Pages that link to "Item:Q1949098"

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

Displayed 4 items.

• An introduction to the discharging method via graph coloring (Q507506) ‎ (← links)
• Acyclic coloring of graphs without bichromatic long path (Q889416) ‎ (← links)
• (Q4578234) ‎ (← links)
• Acyclic 4-choosability of planar graphs without intersecting short cycles (Q4603881) ‎ (← links)