Pages that link to "Item:Q4916098"

The following pages link to Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098):

Displaying 14 items.

• Acyclically 4-colorable triangulations (Q264190) (← 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 without adjacent short cycles (Q713156) (← links)
• Equitable partition of planar graphs (Q2022132) (← 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)
• On acyclically 4-colorable maximal planar graphs (Q2318233) (← links)
• Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
• (Q4578234) (← links)
• Construction of acyclically 4-colourable planar triangulations with minimum degree 4 (Q5031739) (← links)
• Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)