The following pages link to (Q3424893):
Displaying 22 items.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← 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)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles (Q1045104) (← 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)
- On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
- Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable (Q2851536) (← links)
- Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
- Acyclic 4-choosability of planar graphs without 4-cycles (Q3297010) (← links)
- A Conjecture of Borodin and a Coloring of Grünbaum (Q3439434) (← links)
- Acyclic 4-choosability of planar graphs without intersecting short cycles (Q4603881) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
