Pages that link to "Item:Q2078245"

The following pages link to Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245):

Displaying 15 items.

• 3-list-coloring planar graphs of girth 4 (Q626855) (← links)
• Planar graphs without cycles of specific lengths (Q697075) (← links)
• Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← links)
• A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
• A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
• Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
• Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
• Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
• Planar graphs without triangular 4-cycles are 3-choosable (Q2454484) (← links)
• List colourings of planar graphs. (Reprint) (Q2498006) (← links)
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
• The 4-choosability of planar graphs without 6-cycles (Q2760437) (← links)
• (Q3099255) (← links)
• On 3-colorable non-4-choosable planar graphs (Q3122897) (← links)
• Planar graphs without intersecting 5-cycles are signed-4-choosable (Q5101876) (← links)