Pages that link to "Item:Q5894310"

The following pages link to Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310):

Displaying 10 items.

• 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 without adjacent short cycles (Q713156) (← 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)
• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles (Q2042281) (← links)
• Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
• Acyclic 4-choosability of planar graphs without 4-cycles (Q3297010) (← links)
• Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)