Contents

Ars Combinatoria

  • Research article

Total Coloring of Series-Parallel Graphs

Jian-Liang Wu1, Daiqiang Hu2
1 Shandong University of Science and Technology Jinan,250031, P. R. China
2 Department of Mathematics, Jinan University, Guangzhou, 510632, P. R. China
  • Published: 31/10/2004

Abstract

It is proved that the total chromatic number of any series-parallel graphs of degree at least \(3\) is \(\Delta(G)+1\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jian-Liang Wu, Daiqiang Hu. Total Coloring of Series-Parallel Graphs[J], Ars Combinatoria, Volume 073. 215-217. .