Edge-face coloring of plane graphs with maximum degree nine
From MaRDI portal
Publication:3168662
DOI10.1002/jgt.20506zbMath1221.05162MaRDI QIDQ3168662
Jean-Sébastien Sereni, Matěj Stehlík
Publication date: 19 April 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20506
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Entire colouring of plane graphs, Facial entire colouring of plane graphs, The edge-face choosability of plane graphs with maximum degree at least 9
Cites Work
- Unnamed Item
- Unnamed Item
- On simultaneous edge-face colorings of plane graphs
- Simultaneous coloring of edges and faces of plane graphs
- Simultaneously colouring the edges and faces of plane graphs
- List edge and list total colourings of multigraphs
- Total chromatic number of planar graphs with maximum degree ten
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- On improving the edge-face coloring theorem