Pages that link to "Item:Q1752596"

The following pages link to Planar graphs without chordal 6-cycles are 4-choosable (Q1752596):

Displaying 13 items.

• Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
• Planar graphs without cycles of specific lengths (Q697075) (← 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)
• Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
• Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
• List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
• Planar graphs without intersecting 5-cycles are 4-choosable (Q2397522) (← links)
• Planar graphs without triangular 4-cycles are 3-choosable (Q2454484) (← links)
• Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
• The 4-choosability of planar graphs without 6-cycles (Q2760437) (← links)
• Planar Graphs without 7-Cycles Are 4-Choosable (Q3583295) (← links)
• 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)