A linear algorithm for finding total colorings of partial fc-trees

Shuji Isobe; Xiao Zhou; Takao Nishizeki

doi:10.1007/3-540-46632-0_35

A linear algorithm for finding total colorings of partial fc-trees

Shuji Isobe, Xiao Zhou, Takao Nishizeki

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 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. 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, i.e., graphs with bounded tree-width. However, no efficient algorithm has been known for the total coloring problem on partial fc-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 fc-trees with bounded fc.

Original language	English
Title of host publication	Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings
Editors	C. Pandu Rangan, Alok Aggarwal
Publisher	Springer-Verlag
Pages	347-356
Number of pages	10
ISBN (Print)	3540669167, 9783540669166
DOIs	https://doi.org/10.1007/3-540-46632-0_35
Publication status	Published - 1999 Jan 1
Event	10th Annual International Symposium on Algorithms and Computation, ISAAC 1999 - Chennai, India Duration: 1999 Dec 16 → 1999 Dec 18

Publication series

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

Other

Other	10th Annual International Symposium on Algorithms and Computation, ISAAC 1999
Country/Territory	India
City	Chennai
Period	99/12/16 → 99/12/18

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-46632-0_35

Cite this

Isobe, S., Zhou, X., & Nishizeki, T. (1999). A linear algorithm for finding total colorings of partial fc-trees. In C. P. Rangan, & A. Aggarwal (Eds.), Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings (pp. 347-356). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1741). Springer-Verlag. https://doi.org/10.1007/3-540-46632-0_35

A linear algorithm for finding total colorings of partial fc-trees. / Isobe, Shuji ; Zhou, Xiao; Nishizeki, Takao.

Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings. ed. / C. Pandu Rangan; Alok Aggarwal. Springer-Verlag, 1999. p. 347-356 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1741).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Isobe, S , Zhou, X & Nishizeki, T 1999, A linear algorithm for finding total colorings of partial fc-trees. in CP Rangan & A Aggarwal (eds), Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1741, Springer-Verlag, pp. 347-356, 10th Annual International Symposium on Algorithms and Computation, ISAAC 1999, Chennai, India, 99/12/16. https://doi.org/10.1007/3-540-46632-0_35

Isobe S , Zhou X, Nishizeki T. A linear algorithm for finding total colorings of partial fc-trees. In Rangan CP, Aggarwal A, editors, Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings. Springer-Verlag. 1999. p. 347-356. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-46632-0_35

Isobe, Shuji ; Zhou, Xiao ; Nishizeki, Takao. / A linear algorithm for finding total colorings of partial fc-trees. Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings. editor / C. Pandu Rangan ; Alok Aggarwal. Springer-Verlag, 1999. pp. 347-356 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2890e7d33f7348c58d205f21052346ed,

title = "A linear algorithm for finding total colorings of partial fc-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. 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, i.e., graphs with bounded tree-width. However, no efficient algorithm has been known for the total coloring problem on partial fc-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 fc-trees with bounded fc.",

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

year = "1999",

month = jan,

day = "1",

doi = "10.1007/3-540-46632-0_35",

language = "English",

isbn = "3540669167",

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

publisher = "Springer-Verlag",

pages = "347--356",

editor = "Rangan, {C. Pandu} and Alok Aggarwal",

booktitle = "Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings",

note = "10th Annual International Symposium on Algorithms and Computation, ISAAC 1999 ; Conference date: 16-12-1999 Through 18-12-1999",

}

TY - GEN

T1 - A linear algorithm for finding total colorings of partial fc-trees

AU - Isobe, Shuji

AU - Zhou, Xiao

AU - Nishizeki, Takao

PY - 1999/1/1

Y1 - 1999/1/1

N2 - 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. 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, i.e., graphs with bounded tree-width. However, no efficient algorithm has been known for the total coloring problem on partial fc-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 fc-trees with bounded fc.

AB - 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. 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, i.e., graphs with bounded tree-width. However, no efficient algorithm has been known for the total coloring problem on partial fc-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 fc-trees with bounded fc.

UR - http://www.scopus.com/inward/record.url?scp=33746049102&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746049102&partnerID=8YFLogxK

U2 - 10.1007/3-540-46632-0_35

DO - 10.1007/3-540-46632-0_35

M3 - Conference contribution

AN - SCOPUS:33746049102

SN - 3540669167

SN - 9783540669166

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 347

EP - 356

BT - Algorithms and Computation - 10th International Symposium, ISAAC 1999, Proceedings

A2 - Rangan, C. Pandu

A2 - Aggarwal, Alok

PB - Springer-Verlag

T2 - 10th Annual International Symposium on Algorithms and Computation, ISAAC 1999

Y2 - 16 December 1999 through 18 December 1999

ER -

A linear algorithm for finding total colorings of partial fc-trees

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this