A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
From MaRDI portal
Publication:1613521
DOI10.1016/S0012-365X(01)00451-4zbMath1005.05020WikidataQ123016908 ScholiaQ123016908MaRDI QIDQ1613521
Publication date: 29 August 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The edge-face choosability of plane graphs ⋮ Vertex-pancyclicity of edge-face-total graphs ⋮ Facial edge-face coloring of \(K_4\)-minor-free graphs ⋮ Facial entire colouring of plane graphs ⋮ Entire colouring of plane graphs ⋮ The edge-face choosability of plane graphs with maximum degree at least 9 ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Edge-face list coloring of Halin graphs ⋮ Plane graphs with maximum degree 6 are edge-face 8-colorable ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero
