The following pages link to (Q3115199):
Displayed 10 items.
- Acyclically 4-colorable triangulations (Q264190) (← 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)
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
- A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)