Pages that link to "Item:Q1949098"
From MaRDI portal
The following pages link to Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098):
Displaying 20 items.
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← 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)
- (Q3115057) (← links)
- Acyclic 4-choosability of planar graphs without 4-cycles (Q3297010) (← links)
- Acyclic 5-choosability of planar graphs without small cycles (Q3427375) (← links)
- Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← 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)
- Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
