Total Colorings Of Degenerate Graphs |
| |
Authors: | Shuji Isobe Xiao Zhou Takao Nishizeki |
| |
Affiliation: | (1) Graduate School of Information Sciences, Tohoku University, Aoba-yama 6-6-05, Sendai 980-8579, Japan |
| |
Abstract: | A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. A graph G is s-degenerate for a positive integer s if G can be reduced to a trivial graph by successive removal of vertices with degree ≤s. We prove that an s-degenerate graph G has a total coloring with Δ+1 colors if the maximum degree Δ of G is sufficiently large, say Δ≥4s+3. Our proof yields an efficient algorithm to find such a total coloring. We also give a lineartime algorithm to find a total coloring of a graph G with the minimum number of colors if G is a partial k-tree, that is, the tree-width of G is bounded by a fixed integer k. |
| |
Keywords: | 05C15 05C85 90C39 |
本文献已被 SpringerLink 等数据库收录! |
|