Generalized vertex-colorings of partial k-trees

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 4, 2000, Pages 671-677

  Zhou, Xiao ^a   Kanari, Yasuaki ^b   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b Sendai R and D Lab Co Ltd   (Japan)

Author keywords

Algorithm; Generalized vertex coloring; l coloring; Partial k tree

Indexed keywords

GENERALIZED VERTEX COLORINGS;

ALGORITHMS;

TREES (MATHEMATICS);

EID: 0033722049     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. S. Arnborg and J. Lagergren, "Easy problems for tree-decomposable graphs," Journal of Algorithms, vol.12, no.2, pp.308-340, 1991.
2. H.L. Bodlaender, "Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees," Journal of Algorithms, vol.11, no.4, pp.631-643, 1990.
3. H.L. Bodlaender, "A linear time algorithm for finding tree-decompositions of small tree-width," SIAM Journal on Computing, vol.25, pp.1305-1317, 1996.
4. H.L. Bodlaender and T. Hagerup, "Parallel algorithms with optimal speedup for bounded treewidth," SIAM Journal on Computing, vol.27, pp.1725-1746, 1998.
5. R.B. Borie, R.G. Parker, and C.A. Tovey, "Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families," Algorithmica, vol.7, pp.555-581, 1992.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., New York, 1979.
7. S. Isobe, X. Zhou, and T. Nishizeki, "A polynomial-time algorithm for finding total colorings of partial k-trees," International Journal of Foundations of Computer Science, vol.10, pp.171-194, 1999.
8. X. Zhou and T. Nishizeki, "Algorithms for finding f-colorings of partial k-trees," Proc. of the Sixth International Symposium on Algorithms and Computation, Lect. Notes in Computer Science, Springer-Verlag, vol.1004, pp.332-341, 1995.
9. X. Zhou, S. Tamura, and T. Nishizeki, "Finding edge-disjoint paths in partial k-trees," Algorithmica, vol.26, pp.3-30, 2000.
10. X. Zhou, S. Nakano, and T. Nishizeki, "Edge-coloring partial k-trees," Journal of Algorithms, vol.21, pp.598-617, 1996.