Pages that link to "Item:Q1949098"

The following pages link to Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098):

Displaying 10 items.

• An introduction to the discharging method via graph coloring (Q507506) (← links)
• Acyclic coloring of graphs without bichromatic long path (Q889416) (← 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)
• An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
• Acyclic 4-choosability of planar graphs without 4-cycles (Q3297010) (← links)
• (Q4578234) (← links)
• Acyclic 4-choosability of planar graphs without intersecting short cycles (Q4603881) (← links)
• Construction of acyclically 4-colourable planar triangulations with minimum degree 4 (Q5031739) (← links)