Plane graphs with maximum degree 6 are edge-face 8-colorable
DOI10.1007/S00373-013-1308-XzbMATH Open1298.05084OpenAlexW2028677278MaRDI QIDQ742598FDOQ742598
Authors: Min Chen, André Raspaud, Weifan Wang 
Publication date: 19 September 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1308-x
Recommendations
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- Plane graphs of maximum degree \(\Delta \geq 7\) are edge-face \((\Delta + 1)\)-colorable
- Every plane graph of maximum degree 8 has an edge-face 9-coloring
- Edge-face coloring of plane graphs with maximum degree nine
- A six-color theorem for the edge-face coloring of plane graphs
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Simultaneous coloring of edges and faces of plane graphs
- Graph theory with applications
- Title not available (Why is that?)
- On simultaneous edge-face colorings of plane graphs
- Simultaneously colouring the edges and faces of plane graphs
- A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
- The edge-face choosability of plane graphs
- Title not available (Why is that?)
- On improving the edge-face coloring theorem
- A five-color theorem
- A six-color theorem for the edge-face coloring of plane graphs
- Every plane graph of maximum degree 8 has an edge-face 9-coloring
- Title not available (Why is that?)
- Edge‐face chromatic number and edge chromatic number of simple plane graphs
- Title not available (Why is that?)
Cited In (12)
- Facial entire colouring of plane graphs
- Plane graphs of maximum degree \(\Delta \geq 7\) are edge-face \((\Delta + 1)\)-colorable
- Edge-face coloring of plane graphs with maximum degree nine
- An improved upper bound on the edge-face coloring of 2-connected plane graphs
- Edge-face list coloring of Halin graphs
- The edge-face choosability of plane graphs with maximum degree at least 9
- Facial edge-face coloring of \(K_4\)-minor-free graphs
- Edge-face choosability of near-outerplane graphs
- Every plane graph of maximum degree 8 has an edge-face 9-coloring
- A six-color theorem for the edge-face coloring of plane graphs
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- A seven-color theorem on edge-face coloring of plane graphs
This page was built for publication: Plane graphs with maximum degree 6 are edge-face 8-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742598)
