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. © 2011 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
APA
Liu, G., Wang, B., & Wu, J. L. (2011). Total colorings of planar graphs with maximum degree seven and without 3-cycles adjacent to 5-cycles. In Advances in Intelligent and Soft Computing (Vol. 122, pp. 335–342). https://doi.org/10.1007/978-3-642-25664-6_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free