Pages that link to "Item:Q990957"

The following pages link to Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957):

Displaying 12 items.

• Acyclic 4-choosability of planar graphs (Q616366) (← 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)
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
• Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
• Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
• Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← 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)
• Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)