Pages that link to "Item:Q890814"
From MaRDI portal
The following pages link to Acyclic 3-choosability of planar graphs with no cycles of length from 4 to 11 (Q890814):
Displaying 14 items.
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- List 2-facial 5-colorability of plane graphs with girth at least 12 (Q658054) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← 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)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles (Q2042281) (← links)
- A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
- Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)
