Skip to main content
Springer Nature Link
Log in

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

  • Session 7A: Combinatorics
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 959))

Included in the following conference series:

  • 155 Accesses

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.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Chartrand and L. Lesniak,“Graphs and Digraph”,Second edition, Wadswordth and Brooks/Cole, Monterey, Calif, 1986

    Google Scholar 

  2. Hu Guanzhang, Zhang Zhongfu, The Edge-face total colouring of planar graphs, Journal of Tsinghua University, Vol 32, 3(1992),18–23

    Google Scholar 

  3. Zhang Zhongfu e. t. c. The Complete chromatic number of some graphs, Science in China (Series A), Vol 36,10 (1993),1169∼1177

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lanzhou Railway Institute, 730070, China

    C. F. Chang, J. X. Chang & X. C. Lu

  2. Dept. of. Math., Hong Kong Baptist University, China

    Peter C. B. Lam

  3. Ins. Appl. Math., Academic Sinica, 100080, Beijing, China

    J. F. Wang

Authors
  1. C. F. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. X. Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. X. C. Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Peter C. B. Lam
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J. F. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Ming Li

Rights and permissions

Reprints 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

  • DOI: https://doi.org/10.1007/BFb0030858

  • 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

Publish with us

Policies and ethics