Pages that link to "Item:Q1245228"
From MaRDI portal
The following pages link to Every planar graph has an acyclic 7-coloring (Q1245228):
Displaying 37 items.
- Acyclic coloring with few division vertices (Q396683) (← links)
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles (Q1045104) (← links)
- On acyclic colorings of planar graphs (Q1257487) (← links)
- Good and semi-strong colorings of oriented planar graphs (Q1334637) (← links)
- Acyclic \(k\)-strong coloring of maps on surfaces (Q1581455) (← links)
- Acyclic colorings of locally planar graphs (Q1767633) (← links)
- On acyclic colorings of graphs on surfaces (Q1916898) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← links)
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128) (← links)
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
- On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 (Q2032901) (← links)
- An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
- Circular vertex arboricity (Q2275930) (← links)
- Acyclic chromatic indices of planar graphs with large girth (Q2275931) (← links)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- Acyclic coloring of IC-planar graphs (Q2329208) (← links)
- Acyclic vertex coloring of graphs of maximum degree six (Q2449135) (← links)
- On acyclic colorings of planar graphs. (Reprint) (Q2497996) (← links)
- Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable (Q2851536) (← links)
- A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
- Acyclic 4-choosability of planar graphs without 4-cycles (Q3297010) (← links)
- A Conjecture of Borodin and a Coloring of Grünbaum (Q3439434) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- An acyclic analogue to Heawood's theorem (Q4156455) (← links)
- Acyclic 4-choosability of planar graphs without intersecting short cycles (Q4603881) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4 (Q5031739) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
- Acyclic 3-coloring of generalized Petersen graphs (Q5963660) (← links)
- Injective edge-coloring of subcubic graphs (Q6115745) (← links)