Pages that link to "Item:Q2566160"
From MaRDI portal
The following pages link to A note on 3-choosability of planar graphs without certain cycles (Q2566160):
Displaying 25 items.
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
- Cyclicity of several planar graphics and ensembles through three singular points without generic conditions (Q935124) (← links)
- On 3-colorable planar graphs without short cycles (Q998606) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- DP-3-coloring of some planar graphs (Q1618234) (← links)
- Retracted article: ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles'' (Q1675871) (← links)
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate (Q1981692) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Planar graphs without specific cycles are 2-degenerate (Q2037563) (← links)
- On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
- A sufficient condition for a planar graph to be 3-choosable (Q2380013) (← links)
- A note on 3-choosability of planar graphs (Q2380076) (← links)
- Planar graphs without triangular 4-cycles are 3-choosable (Q2454484) (← links)
- On 3-colorable planar graphs without prescribed cycles (Q2461207) (← links)
- Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- A note on 3-choosability of planar graphs related to Montanssier's conjecture (Q2810722) (← links)
- (Q3180354) (← links)
- Characterization of Cycle Obstruction Sets for Improper Coloring Planar Graphs (Q4564884) (← links)
- (Q5442386) (← links)
