Pages that link to "Item:Q738863"

The following pages link to Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863):

Displaying 13 items.

• A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
• The 4-choosability of plane graphs without 4-cycles (Q1305526) (← links)
• A new sufficient condition for a toroidal graph to be 4-choosable (Q1660275) (← links)
• Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable (Q1712501) (← links)
• The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
• Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
• On sufficient conditions for planar graphs to be 5-flexible (Q2117537) (← links)
• DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
• Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
• Planar graphs without triangular 4-cycles are 3-choosable (Q2454484) (← links)
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
• Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)