Skip to main content
SpringerLink
Log in

Total Colorings of Graphs with Minimum Sum of Colors

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

Abstract

The total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We construct infinite families of graphs for which the minimum number of colors to achieve the total chromatic sum is larger than the total chromatic number.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Behzad, M.: Graphs and their chromatic numbers, Ph.D. Thesis, Michigan State University, 69 pages (1965)

  2. Erdős, P., Kubicka, E., Schwenk, A.: Graphs that require many colors to achieve their chromatic sum. Congr. Numer. 71, 17–28 (1990)

    MathSciNet  MATH  Google Scholar 

  3. Jiang, T., West, D.B.: Coloring of trees with minimum sum of colors. J. Gr. Theory 32, 354–358 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Kubicka, E.: The chromatic sums of graphs; history and recent developments. Int. J. Math. Sci. 30, 1563–1573 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  5. Kubicka, E., Schwenk, A.: Introduction to chromatic sums. Congr. Numer. 71, 17–28 (1990)

    MathSciNet  Google Scholar 

  6. Kubicka, E.: The chromatic sum and efficient tree algorithms, Ph.D. Thesis, Western Michigan University, 149 pages (1989)

  7. Leidner, M.: The study of the total coloring of graphs, Ph.D. Thesis, University of Louisville, 101 pages (2012)

  8. Mitchem, J., Morris, P., Schmeichel, E.: On the cost chromatic number of outerplanar, planar, and line graphs. Discuss. Math. Graph Theory 2, 229–241 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  9. Vizing, V.G.: On an estimate of the chromatic class of a \(p\)-graph. Diskret. Analiz No. 3, 29–39 (1964)

    MathSciNet  Google Scholar 

  10. Vizing, V.G.: The chromatic class of a multigraph. Kibernetika (Kiev) 3, 25–30 (1965)

    MathSciNet  MATH  Google Scholar 

  11. Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38, 364–372 (1980)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Louisville, Louisville, USA

    Ewa M. Kubicka, Grzegorz M. Kubicki & Maxfield Leidner

Authors
  1. Ewa M. Kubicka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grzegorz M. Kubicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maxfield Leidner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ewa M. Kubicka.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kubicka, E.M., Kubicki, G.M. & Leidner, M. Total Colorings of Graphs with Minimum Sum of Colors. Graphs and Combinatorics 32, 2515–2524 (2016). https://doi.org/10.1007/s00373-016-1720-0

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-016-1720-0

Keywords

Search

Navigation