@inproceedings{d7ee48a934274624b5fcf20a26b81a54,

title = "A polynomial-time algorithm for finding total colorings of partial k-trees",

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. Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by a constant k). However, no polynomial-time algorithm has been known for the problem of finding a total coloring of a given partial k-tree with the minimum number of colors. This paper gives such a first polynomial-time algorithm.",

author = "Shuji Isobe and Xiao Zhou and Takao Nishizeki",

year = "1998",

doi = "10.1007/10692760_9",

language = "English",

isbn = "3540651950",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "100--113",

editor = "Juraj Hromkovic and Ondrej Sykora",

booktitle = "Graph-Theoretic Concepts in Computer Science - 24th International Workshop, WG 1998, Proceedings",

note = "24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1998 ; Conference date: 18-06-1998 Through 20-06-1998",

}