Pages that link to "Item:Q1850547"

The following pages link to On structure of some plane graphs with application to choosability (Q1850547):

Displaying 23 items.

• Free choosability of outerplanar graphs (Q293600) (← links)
• Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable (Q858302) (← links)
• List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
• A non-3-choosable planar graph without cycles of length 4 and 5 (Q868377) (← links)
• On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
• On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
• A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles (Q1430647) (← links)
• Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
• The edge-face choosability of plane graphs (Q1883606) (← links)
• Choosability of planar graphs (Q1916256) (← links)
• The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
• Planar graphs without 7-cycles and butterflies are DP-4-colorable (Q2185894) (← 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)
• Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← 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)
• A characterization of (4,2)‐choosable graphs (Q3299217) (← links)
• DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
• 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
• Variable degeneracy of planar graphs without chorded 6-cycles (Q6652636) (← links)