Pages that link to "Item:Q1272182"

The following pages link to On simultaneous edge-face colorings of plane graphs (Q1272182):

Displaying 23 items.

• Entire colouring of plane graphs (Q651038) (← links)
• Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
• Facial entire colouring of plane graphs (Q898120) (← links)
• Entire choosability of near-outerplane graphs (Q1025470) (← links)
• The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
• Simultaneous coloring of edges and faces of plane graphs (Q1322167) (← links)
• Simultaneously colouring the edges and faces of plane graphs (Q1354728) (← links)
• A five-color theorem (Q1567630) (← links)
• A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs (Q1613521) (← links)
• Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
• The edge-face choosability of plane graphs (Q1883606) (← links)
• Vertex-pancyclicity of edge-face-total graphs (Q1887075) (← 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)
• A note on the simultaneous edge coloring (Q2305899) (← links)
• Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
• The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
• A note on face coloring entire weightings of plane graphs (Q2450136) (← links)
• Edge-face coloring of plane graphs with maximum degree nine (Q3168662) (← links)
• (Q4329138) (← links)
• (Q4701960) (← links)
• An improved upper bound on the edge-face coloring of 2-connected plane graphs (Q6611726) (← links)