Pages that link to "Item:Q2760437"

The following pages link to The 4-choosability of planar graphs without 6-cycles (Q2760437):

Displaying 15 items.

• Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
• List coloring of planar graphs with forbidden cycles (Q510959) (← links)
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
• Planar graphs without cycles of specific lengths (Q697075) (← links)
• Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
• The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
• Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
• DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
• The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
• Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
• Choosability of toroidal graphs without short cycles (Q3055923) (← links)
• Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295) (← links)
• Toroidal graphs containing neither nor 6‐cycles are 4‐choosable (Q5272640) (← links)