Skip to main content
Springer Nature Link
Log in

Equitable Total Coloring of Graphs with Maximum Degree 3

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 The equitable total chromatic number χr d q u o; e (G) of a graph G is the smallest integer k for which G has a total k-coloring such that the number of vertices and edges in any two color classes differ by at most one. We prove in this paper that χr d q u o; e (G)≤5 if G is a multigraph with maximum degree at most 3.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Author information

Authors and Affiliations

  1. Department of Mathematics, Zhejiang Normal University, Jinhua, Zhejiang 321004, China e-mail: wwf@lnu.edu.cn, , , , , , CN

    Wei-Fan Wang

Authors
  1. Wei-Fan Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: February 24, 2000 Final version received: February 2, 2001

Acknowledgments. The author would like to thank the referee for valuable suggestions to improve this work.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, WF. Equitable Total Coloring of Graphs with Maximum Degree 3. Graphs Comb 18, 677–685 (2002). https://doi.org/10.1007/s003730200051

Download citation

  • Issue Date:

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

Keywords