Advertisement

Edge-face total chromatic number of outerplanar graphs with Δ (G)=6

  • C. F. Chang
  • J. X. Chang
  • X. C. Lu
  • Peter C. B. Lam
  • J. F. Wang
Session 7A: Combinatorics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Chartrand and L. Lesniak,“Graphs and Digraph”,Second edition, Wadswordth and Brooks/Cole, Monterey, Calif, 1986Google Scholar
  2. 2.
    Hu Guanzhang, Zhang Zhongfu, The Edge-face total colouring of planar graphs, Journal of Tsinghua University, Vol 32, 3(1992),18–23Google Scholar
  3. 3.
    Zhang Zhongfu e. t. c. The Complete chromatic number of some graphs, Science in China (Series A), Vol 36,10 (1993),1169∼1177Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • C. F. Chang
    • 1
  • J. X. Chang
    • 1
  • X. C. Lu
    • 1
  • Peter C. B. Lam
    • 2
  • J. F. Wang
    • 3
  1. 1.Lanzhou Railway InstituteChina
  2. 2.Dept. of. Math.Hong Kong Baptist UniversityChina
  3. 3.Ins. Appl. Math.Academic SinicaBeijingChina

Personalised recommendations