Skip to main content
SpringerLink
Log in

The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

The total chromatic number of series-parallel graphs of maximum degree greater than or equal to 4 will be determined using the double inductions and the method of exchanging colors from the aspect of configuration property. Thus, the result of paper [7] is a special case of this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Duffin, R.J.: Topology of Series-Parallel Networks. J. Math Analy. App. 10, 303–318 (1965)

    Google Scholar 

  2. Jian, L.W.: The Linear Arboricity of Series-Parallel. Graphs Combinatorics 16, 367–371 (2000)

    Google Scholar 

  3. Bondy, J.A., Murty: Graph Theory with Application. Macmillan Press.LTD, 1976

  4. Behzad, M.: Graph and their Chromatic Number. Doctorial Thesis (Michigan State University), 1965

  5. Vijayditya, N.: On Total Chromatic Number of a Graph. J. London. Math. Soc. 3(2), 405–408 (1971)

    Google Scholar 

  6. Bollobas, B., Harris, A.J.: List Coloring of Graphs. Graphs Combinatorics (1): 115–127 (1985)

  7. Zhongfu, Z., Jianxun, Z., Jianfang, W.: The Total Chromatic Number of Some Graphs. Scienta Sinica, Series A. 1988, pp. 1434–1443

  8. Chen, D.-L., Wu, J.-L.: The Total Chromatic Number of Descartes Product Graphs. J. TaiYuan Mechanism Institute, 1994, Vol. 15 Supp.

  9. Yap, H.P.: Some Topics in Graph Theory. London: Combridge, 1986. Chinese Version: Press of University of Science and Technology of China, 1992

  10. Zhang, Z.F., Wang, J.F.: The Progress of Total Coloring Graphs. Adv. Math. 21 390–397 (1992)

    Google Scholar 

  11. Chen, D.L., Wu, J.L.: The Total Coloring of Some Graphs, Combinatorics, Graph Theory Algorithms and Applications (Beijing, 1993). World Sci. Publishing, River Edge, N.J, supp. 17–20, 1994

  12. Yap, H.P.: The Total Coloring of Graphs. Lecture Notes in Mathematics 1623, Springer 1996, Printed in Germany

  13. Eckhoff, J.: the Maximum Number of Triangles in a K 4-free Graph. Dis. Math. 194, pp. 95–106

  14. Dirac, G.A.: A Property of 4-Chromatic Graphs and some Results on Critical Graphs. J. London Math. Soc. 27, 85–92 (1952)

    Google Scholar 

  15. Seymour, P.D.: Coloring the Series-Parallel Graphs. Combinatorica 10(4), 379–392 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Shandong University of Science and Technology, Taian, Shandong, 271019, People's Republic of China

    Shu-Dong Wang & Shan-Chen Pang

Authors
  1. Shu-Dong Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shan-Chen Pang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shu-Dong Wang.

Additional information

This research was supported by National Natural Science Foundation of China under grant NSFC60503002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, SD., Pang, SC. The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) ≥ 4. Graphs and Combinatorics 21, 531–540 (2005). https://doi.org/10.1007/s00373-005-0620-5

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0620-5

Keywords

AMS 1991 Subject Classification

Search

Navigation