Pages that link to "Item:Q742598"

The following pages link to Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598):

Displaying 9 items.

• Facial entire colouring of plane graphs (Q898120) (← links)
• A sufficient condition for a plane graph with maximum degree 6 to be class 1 (Q1759890) (← links)
• A six-color theorem for the edge-face coloring of plane graphs (Q1894780) (← links)
• Edge-face list coloring of Halin graphs (Q2039700) (← links)
• Facial edge-face coloring of \(K_4\)-minor-free graphs (Q2174603) (← links)
• The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
• Edge-face coloring of plane graphs with maximum degree nine (Q3168662) (← links)
• Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorable (Q5066912) (← links)
• An improved upper bound on the edge-face coloring of 2-connected plane graphs (Q6611726) (← links)