Abstract
Let G be a planar graph with maximum degree ∆ ≥ 7 and without 3-cycles adjacent to 4-cycles, that is, any 3-cycle has not a common edge with a 5-cycle. Then the total chromatic number of G is ∆ + 1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Behzad, M.: Graphs and their chromatic numbers, Ph. D. Thesis, Michigan State University (1965)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. MacMillan, London (1976)
Borodin, O.V.: On the total coloring of planar graphs. J. Reine Angew. Math. 394, 180–185 (1989)
Borodin, O.V., Kostochka, A.V., Woodall, D.R.: List edge and list total colourings of multigraphs. J. Combin. Theory Ser. B 71, 184–204 (1997)
Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Total colorings of planar graphs with large maximum degree. J. Graph Theory 26, 53–59 (1997)
Borodin, O.V., Kostochka, A.V., Woodall, D.R.: Total colourings of planar graphs with large girth. Europ. J. Combin. 19, 19–24 (1998)
Chang, G., Hou, J., Roussel, N.: Local condition for planar graphs of maximum degree 7 to be 8-totally-colorable (submitted)
Du, D., Shen, L., Wang, Y.: Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. Discrete Applied Math. 157, 6035–6043 (2009)
Kowalik, L., Sereni, J.-S., Skrekovski, R.: Total colorings of planar graphs with maximum degree nine. SIAM J. Discrete Math. 22, 1462–1479 (2008)
Kostochka, A.V.: The total chromatic number of any multigraph with maximum degree five is at most seven. Discrete Math. 162, 199–214 (1996)
Liu, B., Hou, J.F., Wu, J.L., Liu, G.Z.: Total colorings and list total colorings of planar graphs without intersecting 4-cycles. Discrete Math 309(20), 6035–6043 (2009)
Shen, L., Wang, Y.: Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable. Discrete Mathematics 310, 2372–2379 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, G., Wang, B., Wu, Jl. (2011). Total Colorings of Planar Graphs with Maximum Degree Seven and without 3-Cycles Adjacent to 5-Cycles. In: Wang, Y., Li, T. (eds) Foundations of Intelligent Systems. Advances in Intelligent and Soft Computing, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25664-6_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-25664-6_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25663-9
Online ISBN: 978-3-642-25664-6
eBook Packages: EngineeringEngineering (R0)