On forbidden subdivision characterizations of graph classes

We provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of parameters related to the expansion of a graph) in terms of forbidden subdivisions.

[1]  Vojtěch Rödl.  On the chromatic number of subgraphs of a given graph , 1977 .

[2]  Xuding Zhu,et al.  A bound for the game chromatic number of graphs , 1999, Discret. Math..

[3]  Ronald L. Graham,et al.  The Mathematics of Paul Erdős II , 1997 .

[4]  Glenn G. Chappell,et al.  Coloring with no 2-Colored P4's , 2004, Electron. J. Comb..

[5]  David R. Wood,et al.  Acyclic, Star and Oriented Colourings of Graph Subdivisions , 2005, Discret. Math. Theor. Comput. Sci..

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  J. Nesetril,et al.  Colorings and Homomorphisms of Minor Closed Classes , 2003 .

[8]  Richard H. Schelp,et al.  Graphs with Linearly Bounded Ramsey Numbers , 1993, J. Comb. Theory, Ser. B.

[9]  Hal A. Kierstead,et al.  Planar Graph Coloring with an Uncooperative Partner , 1994, Planar Graphs.

[10]  J. Nesetril,et al.  Grad and classes with bounded expansion III. restricted dualities , 2005, math/0508325.

[11]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion II. Algorithmic aspects , 2008, Eur. J. Comb..

[12]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion I. Decompositions , 2008, Eur. J. Comb..

[13]  Oleg V. Borodin,et al.  On acyclic colorings of planar graphs , 2006, Discret. Math..

[14]  Hal A. Kierstead,et al.  Orderings on Graphs and Game Coloring Number , 2003, Order.

[15]  Jaroslav Nesetril,et al.  Grad and classes with bounded expansion III. Restricted graph homomorphism dualities , 2008, Eur. J. Comb..