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. Let us start with several definitions. Throughout the paper, we consider only simple undirected graphs. A graph G = sdt(G) is the t-subdivision of a graph G, if G is obtained from G by replacing each edge by a path with exactly t inner vertices. Similarly, G is a ≤ t-subdivision of G if the graph G can be obtained from G by subdividing each edge by at most t vertices (the number of vertices may be different for each edge). A coloring of vertices of a graph G is proper if no two adjacent vertices have the same color. The minimum k such that the graph G has a proper coloring by k colors is called the chromatic number of G and denoted by χ(G). A proper coloring of a graph G is acyclic if the union of each two color classes induces a forest, i.e., there is no cycle colored by two colors. The minimum k such that the graph G has an acyclic coloring by k colors is called the acyclic chromatic number of G and denoted by χa(G). In this paper, we present an exact characterization of graph classes whose acyclic chromatic number is bounded by a constant. As a motivation, let us consider several older results. Borodin [2] have proved that the acyclic chromatic number of every planar graph is at most 5. Nešetřil and Ossona de Mendez [5] have proved that every graph G has a minor H such that Supported as project 1M0545 by the Czech Ministry of Education
[1]
Vojtěch Rödl.
On the chromatic number of subgraphs of a given graph
,
1977
.
[2]
Oleg V. Borodin,et al.
On acyclic colorings of planar graphs
,
2006,
Discret. Math..
[3]
Wayne Goddard,et al.
Acyclic colorings of planar graphs
,
1991,
Discret. Math..
[4]
Hal A. Kierstead,et al.
Planar Graph Coloring with an Uncooperative Partner
,
1994,
Planar Graphs.
[5]
Richard H. Schelp,et al.
Graphs with Linearly Bounded Ramsey Numbers
,
1993,
J. Comb. Theory, Ser. B.
[6]
Xuding Zhu,et al.
A bound for the game chromatic number of graphs
,
1999,
Discret. Math..
[7]
J. Nesetril,et al.
Colorings and Homomorphisms of Minor Closed Classes
,
2003
.
[8]
J. Nesetril,et al.
Grad and classes with bounded expansion III. restricted dualities
,
2005,
math/0508325.
[9]
David R. Wood,et al.
Acyclic, Star and Oriented Colourings of Graph Subdivisions
,
2005,
Discret. Math. Theor. Comput. Sci..
[10]
Jaroslav Nesetril,et al.
Grad and classes with bounded expansion I. Decompositions
,
2008,
Eur. J. Comb..
[11]
Jaroslav Nesetril,et al.
Grad and classes with bounded expansion II. Algorithmic aspects
,
2008,
Eur. J. Comb..
[12]
Vojtech Rödl,et al.
Arrangeability and Clique Subdivisions
,
2013,
The Mathematics of Paul Erdős II.