On the computational complexity of partial covers of Theta graphs

Discrete Applied Mathematics

Volumn 156, Issue 7, 2008, Pages 1143-1149

  Fiala, Jiří ^a   Kratochvíl, Jan ^a   Pór, Attila ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Computational complexity; Graph homomorphisms; Theta graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; LINEAR EQUATIONS; LINEAR SYSTEMS; PROBLEM SOLVING;

CERTAIN SYSTEMS; GRAPH HOMOMORPHISMS; INTEGRAL SOLUTIONS; THETA GRAPHS;

GRAPH THEORY;

EID: 40149087858     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.05.051     Document Type: Article

References (20)

1. Abello J., Fellows M.R., and Stillwell J.C. On the complexity and combinatorics of covering finite complexes. Austral. J. Combinatorics 4 (1991) 103-112
2. Biggs N. Algebraic Graph Theory (1974), Cambridge University Press, Cambridge
3. Bodlaender H.L. The classification of coverings of processor networks. J. Parallel Distributed Computing 6 (1989) 166-182
4. Everett M.G., and Borgatti S. Role colouring a graph. Math. Social Sci. 21 2 (1991) 183-188
5. Fiala J. NP completeness of the edge precoloring extension problem on bipartite graphs. J. Graph Theory 43 2 (2003) 156-160
6. J. Fiala, J. Kratochvíl, Complexity of partial covers of graphs, in: Algorithms and Computation, 12th ISAAC '01, Christchurch, New Zealand 2001, LNCS, vol. 2223, pp. 537-549.
7. Fiala J., and Kratochvíl J. Partial covers of graphs. Discuss. Math. Graph Theory 22 (2002) 89-99
8. Fiala J., Kratochvíl J., and Kloks T. Fixed-parameter complexity of λ-labelings. Discrete Appl. Math. 113 1 (2001) 59-72
9. J. Fiala, D. Paulusma, The computational complexity of the role assignment problem, in: Automata, Languages and Programming, 30th ICALP '01, Eindhoven, The Netherlands 2003, LNCS, vol. 2719, pp. 817-828.
10. Griggs J.R., and Yeh R.K. Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5 4 (1992) 586-595
11. Hell P., and Nešetřil J. On the complexity of H-colouring. J. Combin. Theory Ser. B 48 (1990) 92-110
12. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press, Oxford
13. Holyer I. The NP-completeness of edge coloring. SIAM J. Comput. 10 4 (1981) 718-720
14. Kratochvíl J., Proskurowski A., and Telle J.A. Covering regular graphs. J. Combin. Theory Ser. B 71 1 (1997) 1-16
15. J. Kratochvíl, A. Proskurowski, J.A. Telle, Covering directed multigraphs I. Colored directed multigraphs, in: Graph-Theoretical Concepts in Computer Science, 23rd WG '97, Berlin, 1997, LNCS, vol. 1335, pp. 242-257.
16. Kratochvíl J., Proskurowski A., and Telle J.A. Complexity of graph covering problems. Nordic J. Computing 5 (1998) 173-195
17. Kratochvíl J., and Sebö A. Coloring precolored perfect graphs. J. Graph Theory 25 3 (1997) 207-215
18. P. Kristiansen, J.A. Telle, Generalized H-coloring of graphs, in: Algorithms and Computation, 11th ISAAC '01, Taipei, Taiwan, 2000, LNCS, vol. 1969, pp. 456-466.
19. Liu D., and Zhu X. Circular distance two labelings and circular chromatic numbers. Ars Combin. 69 4 (2003) 177-183
20. van den Heuvel J., Leese R.A., and Shepherd M.A. Graph labeling and radio channel assignment. J. Graph Theory 29 4 (1998) 263-283