The edge-face choosability of plane graphs with maximum degree at least 9

DOI10.1016/j.disc.2014.03.008zbMath1288.05061MaRDI QIDQ2449158

Xiaoxue Hu, Yi Qiao Wang, Wei Fan Wang

Publication date: 6 May 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.03.008

zbMATH Keywords

coloring; plane graph; maximum degree; edge-face choosability

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C07: Vertex degrees

Related Items

The entire choosability of plane graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Plane graphs with maximum degree 6 are edge-face 8-colorable
• 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
• A five-color theorem
• A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
• The edge-face choosability of plane graphs
• 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
• Edge-face coloring of plane graphs with maximum degree nine
• Edge‐face chromatic number and edge chromatic number of simple plane graphs
• On improving the edge-face coloring theorem
• A seven-color theorem on edge-face coloring of plane graphs