The edge-face choosability of plane graphs

Authors:
Wei-Fan Wang;Ko-Wei Lih
Affiliations:
Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, China;Institute of Mathematics, Academia Sinica, Nankang, Taipei 11529, Taiwan
Venue:
European Journal of Combinatorics
Year:
2004

Citing 8
Cited 1

Simultaneous coloring of edges and faces of plane graphs

Discrete Mathematics
Every planar graph is 5-choosable

Journal of Combinatorial Theory Series B
The list chromatic index of a bipartite multigraph

Journal of Combinatorial Theory Series B
Structural theorem on plane graphs with application to the entire coloring number

Journal of Graph Theory
Simultaneously colouring the edges and faces of plane graphs

Journal of Combinatorial Theory Series B
List edge and list total colourings of multigraphs

Journal of Combinatorial Theory Series B
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs

Discrete Mathematics
Graphs of degree 4 are 5-edge-choosable

Journal of Graph Theory

Entire colouring of plane graphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

A plane graph G is said to be k-edge-face choosable if, for every list L of colors satisfying |L(x)|=k for every edge and face x, there exists a coloring which assigns to each edge and each face a color from its list so that any adjacent or incident elements receive different colors. We prove that every plane graph G with maximum degree Δ(G) is (Δ(G)+3)-edge-face choosable.