Generalized H-coloring of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1969, Issue , 2000, Pages 456-466

  Kristiansen, Petter ^a   Telle, Jan Arne ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

COVER PROBLEM; GENERALIZED H; GRAPH G; INPUT GRAPHS; NATURAL NUMBER; NP COMPLETE;

COLORING;

EID: 84949745889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_39     Document Type: Conference Paper

References (13)

1. James Abello, Michael R. Fellows, and John C. Stillwell. On the complexity and combinatorics of covering finite complexes. Australasian Journal of Combinatorics, 4:103-112, 1991.
2. Jiř Fiala, Ton Kloks, and Jan Kratochvíl. Fixed parameter complexity of λ- labelings. In Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG-99, Ascona, Switzerland, June 17-19, Proceedings, volume 1665 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
3. Theresa W. Haynes, Stephen T. Hedetniemi, and Peter J. Slater. Domination in Graphs. Marcel Dekker, 1998.
4. Pinar Heggernes and Jan Arne Telle. Partitioning graphs into generalized dominating sets. Nordic Journal of Computing, 5:128-142, 1998.
5. Pavol Hell and Jaroslav Nešetřil. On the compexity of H-colouring. Journal of Combinatorial Theory, Series B, 48:92-110, 1990.
6. Ian Holyer. The NP-completeness of edge coloring. SIAM Journal on Computing, 10:718-720, 1981.
7. Jiř Fiala and Jan Kratochvíl. Generalized channel assignment problem and partial covers of graphs. (Submitted).
8. Jan Kratochvíl, Andrzej Proskurowski, and Jan Arne Telle. Complexity of colored graph covers I. In Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG-97, Berlin, Germany, June 18-20, Proceedings, volume 1335 of Lecture Notes in Computer Science, pages 242-257. Springer-Verlag, 1997.
9. Jan Kratochvíl, Andrzej Proskurowski, and Jan Arne Telle. Covering regular graphs. Journal of Combinatorial Theory, Series B, 71(1), 1997.
10. Jan Kratochvíl, Andrzej Proskurowski, and Jan Arne Telle. Complexity of graph covering problems. Nordic Journal of Computing, 5:173-195, 1998.
11. D. Leven and Z. Galil. NP-completeness of finding the chromatic index of regular graphs. Journal of Algorithms, 4(1):35-44, 1983.
12. Thomas J. Shaefer. The complexity of satisfiability problems. ACM Symposium on Theory of Computing, 10:216-226, 1978.
13. Jan Arne Telle and Andrzej Proskurowski. Algorithms for vertex partitioning problems on partial k-trees. SIAM Journal on Discrete Mathematics, 10(4):529-550, 1997.