Pages that link to "Item:Q2888884"
From MaRDI portal
The following pages link to A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884):
Displayed 11 items.
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← 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 choosability of graphs with bounded degree (Q2119462) (← 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)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5894310) (← links)