Pages that link to "Item:Q3174245"

The following pages link to Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245):

Displaying 12 items.

• Acyclic coloring with few division vertices (Q396683) (← 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 without adjacent short cycles (Q713156) (← 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)
• An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
• (Q4578234) (← 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)