Presentation 1999/10/25
A Linear Algorithm for Finding Total Colorings of Partial k-Trees
Shuji Isobe, Xiao Zhou, Takao Nishizeki,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A total coloring of a graph G is to color all vertices and edges of G in a way that no two adjacent or incident elements receive the same color. The total coloring problem is to find a total coloring of a given graph with the minimum number of colors. Many combinatorial problems can be efficiently solved for partial k-trees, that is, graphs with bounded treewidth. However, no efficient algorithm has been known for the total coloring problem on partial k-trees although a polynomial-time algorithm of very high order has been known. In this paper, we give a linear-time algorithm for the total coloring problem on partial k-trees.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) total coloring / total coloring problem / generalized coloring / superimpose / s-degenerated graph
Paper # COMP99-41
Date of Issue

Conference Information
Committee COMP
Conference Date 1999/10/25(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Linear Algorithm for Finding Total Colorings of Partial k-Trees
Sub Title (in English)
Keyword(1) total coloring
Keyword(2) total coloring problem
Keyword(3) generalized coloring
Keyword(4) superimpose
Keyword(5) s-degenerated graph
1st Author's Name Shuji Isobe
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Xiao Zhou
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Takao Nishizeki
3rd Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 1999/10/25
Paper # COMP99-41
Volume (vol) vol.99
Number (no) 388
Page pp.pp.-
#Pages 8
Date of Issue