### 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 | |

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 | India |

City | Chennai |

Period | 99/12/16 → 99/12/18 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

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

## Cite this

*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