Abstract
A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, in such a way that no two adjacent or incident elements receive the same color. Let L(x) be a set of colors assigned to each element x of G. Then a list total coloring of G is a total coloring such that each element x receives a color contained in L(x). The list total coloring problem asks whether G has a list total coloring. In this paper, we first show that the list total coloring problem is NP-complete even for series-parallel graphs. We then give a sufficient condition for a series-parallel graph to have a list total coloring, that is, we prove a theorem that any series-parallel graph G has a list total coloring if |L(v)| ≥ min{5,Δ + 1} for each vertex v and |L(e)| ≥ max{5, d(v) + 1, d(w)+1} for each edge e = vw, where Δ is the maximum degree of G and d(v) and d(w) are the degrees of the ends v and w of e, respectively. The theorem implies that any series-parallel graph G has a total coloring with Δ+1 colors if Δ ≥ 4. We finally present a linear-time algorithm to find a list total coloring of a given series-parallel graph G if G satisfies the sufficient condition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
O. V. Borodin, A. V. Kostochka and D. R. Woodall, List edge and list total colorings of multigraphs, J. Combinatorial Theory, Series B, 71, pp. 184–204, 1997.
T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
R. Diestel, Graph Theory, Springer-verlag, New York, 1997.
T. Fujino, X. Zhou and T. Nishizeki, List edge-colorings of series-parallel graphs, IEICE Trans. on Fundamentals, E86-A,5, pp. 191–203, 2003.
S. Isobe, X. Zhou and T. Nishizeki, Total colorings of degenerated graphs, Proc. of ICALP 2001, Lect. Notes in Computer Science, Springer, 2076, pp. 506–517, 2001.
K. Jansen and P. Scheffler, Generalized coloring for tree-like graphs, Discrete Applied Math., 75, pp. 135–155, 1997.
M. Juvan, B. Mohar and R. Thomas, List edge-coloring of series-parallel graphs, The Electronic Journal of Combinatorics, 6, pp. 1–6, 1999.
T. R. Jensen and B. Toft, Graph Coloring Problems, John Wiley & Sons, New York, 1995.
M. Kubale, Introduction to Computational Complexity and Algorithmic Graph Coloring, Gdańskie Towarzystwo Naukowe, Gdańsk, Poland, 1998.
T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdm, 1988.
T. Nishizeki, J. Vygen and X. Zhou, The edge-disjoint paths problem is NPcomplete for series-parallel graphs, Discrete Applied Math., 115, pp. 177–186, 2001.
A. Sánchez-Arroyo, Determining the total colouring number is NP-hard, Discrete Math., 78, pp. 315–319, 1989.
H. P. Yap, Total Colourings of Graphs, Lect. Notes in Math., 1623, Springer-verlag, Berlin, 1996.
J. L. Wu, List edge-coloring of series-parallel graphs, Shandong Daxue Xuebao Kexue Ban, 35,2, pp. 144–149, 2000 (in Chinese).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, X., Matsuo, Y., Nishizeki, T. (2003). List Total Colorings of Series-Parallel Graphs. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-45071-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40534-4
Online ISBN: 978-3-540-45071-9
eBook Packages: Springer Book Archive