Algorithms for finding distance-edge-colorings of graphs

Lecture Notes in Computer Science

Volumn 3595, Issue , 2005, Pages 798-807

  Ito, Takehiro ^a   Kato, Akira ^a   Zhou, Xiao ^a   Nishizeki, Takao ^a  

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING; ALGORITHMS; COLOR; COLORING; COMBINATORIAL MATHEMATICS; FORESTRY; POLYNOMIAL APPROXIMATION;

DISTANCE-EDGE-COLORING PROBLEM; POLYNOMIAL-TIME; TREE-WIDTH; DISTANCE EDGE COLORINGS; EDGE COLORING; EXACT ALGORITHMS; PARTIAL K-TREES; PLANAR GRAPH;

ALGORITHMS; TREES (MATHEMATICS);

EID: 26844479918     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11533719_81     Document Type: Conference Paper

References (16)

1. G. Agnarsson and M. M. Halldórson, Coloring powers of planar graphs, SIAM J. Discrete Math., Vol. 16, pp. 651-662, 2003.
2. S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, An algebraic theory of graph reduction, J. Assoc. Comput. Mach., Vol. 40, pp. 1134-1164, 1993.
3. S. Arnborg, J. Lagergren and D. Seese, Easy problems for tree-decomposable graphs, J. Algorithms, Vol. 12, pp. 308-340, 1991.
4. B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. Assoc. Comput. Mach., Vol. 41, pp. 153-180, 1994.
5. H. L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, J. Algorithms, Vol. 11, pp. 631-643, 1990.
6. H. L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth, SIAM J. Computing, Vol. 25, pp. 1305-1317, 1996.
7. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoretical Computer Science, Vol. 209, pp. 1-45, 1998.
8. 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.
9. B. Courcelle, The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Information and Computation, Vol. 85, pp. 12-75, 1990.
10. B. Courcelle and M. Mosbah, Monadic second-order evaluations on tree-decomposable graphs, Theoretical Computer Science, Vol. 109, pp. 49-82, 1993.
11. R. Diestel, Graph Theory, Springer-Verlag, New York, 1997.
12. I. Holyer, The NP-completeness of edge-coloring, SIAM J. Computing, Vol. 10, pp. 718-720, 1981.
13. M. Mahdian, On the computational complexity of strong edge coloring, Discrete Applied Mathematics, Vol. 118, pp. 239-248, 2002.
14. M. R. Salavatipour, A polynomial time algorithm for strong edge coloring of partial k-trees, Discrete Applied Mathematics, Vol. 143, pp. 285-291, 2004.
15. X. Zhou, Y. Kanari and T. Nishizeki, Generalized vertex-coloring of partial k-trees, IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences, Vol. E83-A, pp. 671-678, 2000.
16. X. Zhou, S. Nakano and T. Nishizeki, Edge-coloring partial k-trees, J. Algorithms, Vol. 21, pp. 598-617, 1996.