Simultaneously colouring the edges and faces of plane graphs
From MaRDI portal
Publication:1354728
DOI10.1006/jctb.1997.1725zbMath0867.05023MaRDI QIDQ1354728
Publication date: 3 June 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1997.1725
05C15: Coloring of graphs and hypergraphs
Related Items
Entire colouring of plane graphs, Entire choosability of near-outerplane graphs, The edge-face coloring of graphs embedded in a surface of characteristic zero, The edge-face choosability of plane graphs, Vertex-pancyclicity of edge-face-total graphs, Edge-face coloring of plane graphs with maximum degree nine
Cites Work
- An upper bound for total colouring of graphs
- Every planar map is four colorable. II: Reducibility
- Simultaneous coloring of edges and faces of plane graphs
- A six-color theorem for the edge-face coloring of plane graphs
- Ein Sechsfarbenproblem auf der Kugel
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item