A polynomial-time algorithm for finding total colorings of partial k-trees

Shuji Isobe, Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 24th International Workshop, WG 1998, Proceedings
EditorsJuraj Hromkovic, Ondrej Sykora
PublisherSpringer Verlag
Pages100-113
Number of pages14
ISBN (Print)3540651950, 9783540651956
DOIs
Publication statusPublished - 1998
Event24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1998 - Smolenice Castle, Slovakia
Duration: 1998 Jun 181998 Jun 20

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1517
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1998
CountrySlovakia
CitySmolenice Castle
Period98/6/1898/6/20

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A polynomial-time algorithm for finding total colorings of partial k-trees'. Together they form a unique fingerprint.

Cite this