Part of the book series:Lecture Notes in Computer Science ((LNCS,volume 959))
Included in the following conference series:
Abstract
Let G be a planar graph without cut vertex, letχ(G) be the edge-face total chromatic number of G. This paper provesχ(G)=6 if G is an outerplanar graph withΔ(G)=6.
This is a preview of subscription content,log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Chartrand and L. Lesniak,“Graphs and Digraph”,Second edition, Wadswordth and Brooks/Cole, Monterey, Calif, 1986
Hu Guanzhang, Zhang Zhongfu, The Edge-face total colouring of planar graphs, Journal of Tsinghua University, Vol 32, 3(1992),18–23
Zhang Zhongfu e. t. c. The Complete chromatic number of some graphs, Science in China (Series A), Vol 36,10 (1993),1169∼1177
Author information
Authors and Affiliations
Lanzhou Railway Institute, 730070, China
C. F. Chang, J. X. Chang & X. C. Lu
Dept. of. Math., Hong Kong Baptist University, China
Peter C. B. Lam
Ins. Appl. Math., Academic Sinica, 100080, Beijing, China
J. F. Wang
- C. F. Chang
You can also search for this author inPubMed Google Scholar
- J. X. Chang
You can also search for this author inPubMed Google Scholar
- X. C. Lu
You can also search for this author inPubMed Google Scholar
- Peter C. B. Lam
You can also search for this author inPubMed Google Scholar
- J. F. Wang
You can also search for this author inPubMed Google Scholar
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chang, C.F., Chang, J.X., Lu, X.C., Lam, P.C.B., Wang, J.F. (1995). Edge-face total chromatic number of outerplanar graphs with Δ (G)=6. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030858
Download citation
Published:
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-540-60216-3
Online ISBN:978-3-540-44733-7
eBook Packages:Springer Book Archive
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative