Pages that link to "Item:Q1257487"

The following pages link to On acyclic colorings of planar graphs (Q1257487):

Displayed 40 items.

• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) ‎ (← links)
• Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs (Q753827) ‎ (← links)
• On forbidden subdivision characterizations of graph classes (Q925035) ‎ (← links)
• Nonrepetitive colorings of graphs -- a survey (Q925326) ‎ (← links)
• Acyclic edge coloring of subcubic graphs (Q998411) ‎ (← links)
• Homomorphisms of edge-colored graphs and Coxeter groups (Q1272907) ‎ (← links)
• Antisymmetric flows and strong colourings of oriented graphs (Q1296157) ‎ (← links)
• A bound for the game chromatic number of graphs (Q1297403) ‎ (← links)
• The game coloring number of planar graphs (Q1305532) ‎ (← links)
• Good and semi-strong colorings of oriented planar graphs (Q1334637) ‎ (← links)
• Colorings and girth of oriented planar graphs (Q1356774) ‎ (← links)
• A new proof of Grünbaum's 3 color theorem (Q1357735) ‎ (← links)
• Antisymmetric flows and strong oriented coloring of planar graphs (Q1417578) ‎ (← links)
• Acyclic colorings of locally planar graphs (Q1767633) ‎ (← links)
• Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673) ‎ (← links)
• Surfaces, tree-width, clique-minors, and partitions (Q1850479) ‎ (← links)
• Colored homomorphisms of colored mixed graphs (Q1850491) ‎ (← links)
• Minimum feedback vertex set and acyclic coloring. (Q1853123) ‎ (← links)
• Star arboricity of graphs (Q1910571) ‎ (← links)
• On the minimal reducible bound for outerplanar and planar graphs (Q1916137) ‎ (← links)
• On acyclic colorings of graphs on surfaces (Q1916898) ‎ (← links)
• Caterpillar arboricity of planar graphs (Q2370451) ‎ (← links)
• Grad and classes with bounded expansion. I: Decompositions (Q2426456) ‎ (← links)
• On the adaptable chromatic number of graphs (Q2427540) ‎ (← links)
• The game of arboricity (Q2476280) ‎ (← links)
• Weak acyclic coloring and asymmetric coloring games (Q2488942) ‎ (← links)
• Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) ‎ (← links)
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116) ‎ (← links)
• Unique list-colourability and the fixing chromatic number of graphs (Q2576344) ‎ (← links)
• On some arboricities in planar graphs (Q3439376) ‎ (← links)
• A Conjecture of Borodin and a Coloring of Grünbaum (Q3439434) ‎ (← links)
• Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets (Q3439562) ‎ (← links)
• Game coloring the Cartesian product of graphs (Q3605153) ‎ (← links)
• Star coloring bipartite planar graphs (Q3605156) ‎ (← links)
• Acyclic list 7‐coloring of planar graphs (Q4539872) ‎ (← links)
• (Q5708559) ‎ (← links)
• Acyclic dominating partitions (Q5900080) ‎ (← links)
• Homomorphisms of 2-edge-colored graphs (Q5900082) ‎ (← links)
• Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) ‎ (← links)
• Acyclic colouring of 1-planar graphs (Q5954081) ‎ (← links)