Algorithms for finding distance-edge-colorings of graphs

Journal of Discrete Algorithms

Volumn 5, Issue 2 SPEC. ISS., 2007, Pages 304-322

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

^a TOHOKU UNIVERSITY   (Japan)

Author keywords

Algorithm; Approximation algorithm; Distance edge coloring; Partial k trees; Planar graphs

Indexed keywords

APPROXIMATION ALGORITHMS; INTEGER PROGRAMMING; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING;

DISTANCE-EDGE-COLORINGS; PARTIAL K-TREES; PLANAR GRAPHS; POLYNOMIAL-TIME EXACT ALGORITHMS;

GRAPH THEORY;

EID: 34247128128     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2006.03.020     Document Type: Article

References (18)

1. Agnarsson G., and Halldórsson M.M. Coloring powers of planar graphs. SIAM J. Discrete Math. 16 (2003) 651-662
2. Arnborg S., Courcelle B., Proskurowski A., and Seese D. An algebraic theory of graph reduction. J. ACM 40 (1993) 1134-1164
3. Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. J. Algorithms 12 (1991) 308-340
4. Baker B.S. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41 (1994) 153-180
5. Bodlaender H.L. Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. J. Algorithms 11 (1990) 631-643
6. Bodlaender H.L. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25 (1996) 1305-1317
7. Bodlaender H.L. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209 (1998) 1-45
8. Borie R.B., Parker R.G., and Tovey C.A. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica 7 (1992) 555-581
9. Courcelle B. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85 (1990) 12-75
10. Courcelle B., and Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theoret. Comput. Sci. 109 (1993) 49-82
11. Diestel R. Graph Theory (1997), Springer, New York
12. Holyer I. The NP-completeness of edge-coloring. SIAM J. Comput. 10 (1981) 718-720
13. Ito T., Kato A., Zhou X., and Nishizeki T. Algorithms for finding distance-edge-colorings of graphs. Proc. 11th Annual International Computing and Combinatorics Conference (COCOON 2005). Lecture Notes in Computer Science vol. 3595 (2005), Springer, Berlin 798-807
14. L. Kowalik, M. Kurowski, Short path queries in planar graphs in constant time, in: Proc. 35th Annual ACM Symposium on Theory of Computing, 2003, pp. 143-148
15. Mahdian M. On the computational complexity of strong edge coloring. Discrete Appl. Math. 118 (2002) 239-248
16. Salavatipour M.R. A polynomial time algorithm for strong edge coloring of partial k-trees. Discrete Appl. Math. 143 (2004) 285-291
17. Zhou X., Kanari Y., and Nishizeki T. Generalized vertex-coloring of partial k-trees. IEICE Trans. on Fundamentals of Electronics, Communication and Computer Sciences E83-A (2000) 671-678
18. Zhou X., Nakano S., and Nishizeki T. Edge-coloring partial k-trees. J. Algorithms 21 (1996) 598-617