Skip to main content
SpringerLink
Log in

Total colorings of graphs of order 2n having maximum degree 2n−2

  • Original Papers
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let χ t (G) and †(G) denote respectively the total chromatic number and maximum degree of graphG. Yap, Wang and Zhang proved in 1989 that ifG is a graph of orderp having †(G)≥p−4, then χ t (G≤Δ(G)+2. Hilton has characterized the class of graphG of order 2n having †(G)=2n−1 such that χ t (G=Δ(G)+2. In this paper, we characterize the class of graphsG of order 2n having †(G)=2n−2 such that χ t (G=Δ(G)+2

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. Andersen, L.D., Mendelsohn, E.: 1-factorizations ofK 2m with given edges in distinct 1-factors. University Center of Aalborg (1985) (preprint)

  2. Behzad, M., Chartrand, G., Cooper, J.: The colouring numbers of complete graphs. J. London Math. Soc.42, 226–228 (1967)

    MathSciNet  Google Scholar 

  3. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. Elsevier North Holland, Inc., 1976

  4. Chetwynd, A.G., Hilton, A.J.W.: Some refinements of the total chromatic number cojecture. Congressus Numerantium66, 195–216 (1988)

    MathSciNet  Google Scholar 

  5. Hilton, A.J.W.: A total-chromatic number analogue of Plenatholt’s theorem. Discrete Math.79, 169–175 (1989/90)

    Google Scholar 

  6. Kostachka, A.V.: The total coloring of multigraph with maximal degree 4. Discrete Math.17, 161–163 (1977)

    MathSciNet  Google Scholar 

  7. Rosenfeld, M.: On the total coloring of certain graphs. Israel J. Math.,9(3), 396–402 (1971)

    MATH  MathSciNet  Google Scholar 

  8. Vizing, V.G.: On an estimate of the chromatic class of ap-graph (Russian)., Diskret. Analiz3, 25–30 (1964)

    MathSciNet  Google Scholar 

  9. Yap, H.P. Total colourings of graphs. Bull. London Math. Soc.21, 159–163 (1989)

    MATH  MathSciNet  Google Scholar 

  10. Yap, H.P. Wang Jian-Fang Zhang Zhongfu: Total chromatic number of graph of high degree. J. Aust. Math. Soc. (Series A)47, 445–452 (1989)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, National Chiao-Tung University, Hsin-Chu, Taiwan, Republic of China

    Bor-Liang Chen & Hung-Lin Fu

Authors
  1. Bor-Liang Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hung-Lin Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported by National Science Council of the Republic of China (NSC 79-0208-M009-15)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, BL., Fu, HL. Total colorings of graphs of order 2n having maximum degree 2n−2. Graphs and Combinatorics 8, 119–123 (1992). https://doi.org/10.1007/BF02350630

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation