Every Plane Graph of Maximum Degree 8 has an Edge-Face 9-Coloring
Abstract
An edge-face coloring of a plane graph with edge set and face set is a coloring of the elements of such that adjacent or incident elements receive different colors. Borodin [22] proved that every plane graph of maximum degree can be edge-face colored with colors. Borodin’s bound was recently extended to the case where . In this paper, we extend it to the case .
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
O. V. Borodin, Coupled colorings of graphs on a plane, Metody Diskret. Anal., 45 (1987), pp. 21–27, 95, (in Russian).
2.
O. V. Borodin, Simultaneous coloring of edges and faces of plane graphs, Discrete Math., 128 (1994), pp. 21–33.
3.
J. Fiamičík, Simultaneous coloring of 4-valent maps, Mat. Časopis Sloven. Akad. Vied, 21 (1971), pp. 9–13.
4.
E. Jucovič, On a problem in map coloring. Mat. Časopis Sloven. Akad. Vied, 19 (1969), pp. 225–227;
Errata ibid, 20 (1970), p. 224.
5.
L. S. Mel’nikov, Problem 9, in Recent Advances in Graph Theory, Proc. International Symposium, Prague, 1974, M. Fiedler, ed. Academia Praha, 1975, p. 543.
6.
D. P. Sanders and Y. Zhao, On simultaneous edge-face colorings of plane graphs, Combinatorica, 17 (1997), pp. 441–445.
7.
D. P. Sanders and Y. Zhao, On improving the edge-face colorings theorem, Graphs Combin., 17 (2001), pp. 329–341.
8.
J.-S. Sereni and M. Stehlík, Edge-face coloring of plane graphs with maximum degree nine, J. Graph Theory, 66 (2011), pp. 332–346.
9.
A. O. Waller, Simultaneously coloring the edges and faces of plane graphs, J. Combin. Theory Ser. B, 69 (1997), pp. 219–221.
Information & Authors
Information
Published In
Copyright
Copyright © 2011 Society for Industrial and Applied Mathematics.
History
Submitted: 28 December 2009
Accepted: 25 February 2011
Published online: 24 June 2011
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- An improved upper bound on the edge-face coloring of 2-connected plane graphsDiscrete Mathematics, Vol. 347, No. 12 | 1 Dec 2024
- Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorableJournal of Graph Theory, Vol. 95, No. 1 | 3 February 2020
- The edge-face choosability of plane graphs with maximum degree at least 9Discrete Mathematics, Vol. 327 | 1 Jul 2014
- Colorings of plane graphs: A surveyDiscrete Mathematics, Vol. 313, No. 4 | 1 Feb 2013
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].