Complexity of partial covers of graphs

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

Volumn 2223 LNCS, Issue , 2001, Pages 537-549

  Fiala, Jiří ^a   Kratochvíl, Jan ^a  

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; COVER PROBLEM; EDGE PRESERVING; FIXED GRAPHS; GENERALIZED FREQUENCIES; GRAPH G; INPUT GRAPHS; MATCHINGS; NP COMPLETE; PARTIAL COVER; PRECOLORING EXTENSION; POLYNOMIALLY SOLVABLE;

COMPUTATIONAL COMPLEXITY; COMBINATORIAL OPTIMIZATION; FREQUENCY ALLOCATION; GRAPHIC METHODS; PROBLEM SOLVING;

GRAPH THEORY;

EID: 70350674889     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45678-3_46     Document Type: Conference Paper

References (27)

1. ABELLO, J., FELLOWS, M. R., AND STILLWELL, J. C. On the complexity and combinatorics of covering finite complexes. Australian Journal of Combinatorics 4 (1991), 103-112.
2. ANGLUIN, D. Local and global properties in networks of processors. Proceedings of the 12th ACM Symposium on Theory of Computing (1980), 82-93.
3. ANGLUIN, D., and GARDINER, A. Finite common coverings of pairs of regular graphs. Journal of Combinatorial Theory B 30 (1981), 184-187.
4. BIGGS, N. Algebraic Graph Theory. Cambridge University Press, 1974.
5. BODLAENDER, H. L. The classification of coverings of processor networks. Journal of Parallel Distributed Computing 6 (1989), 166-182.
6. CHANG, G. J., AND KUO, D. The L(2, 1)-labeling problem on graphs. SIAM Journal of Discrete Mathematics 9, 2 (May 1996), 309-316.
7. COURCELLE, B., and MÉTIVIER, Y. Coverings and minors: Applications to local computations in graphs. European Journal of Combinatorics 15 (1994), 127-138.
8. FIALA, J. The NP completeness of the edge precoloring extension problem on bipartite graphs. submitted.
9. FIALA, J. Locally injective homomorphisms. PhD thesis, Charles University, Prague, 2000.
10. FIALA, J., and KRATOCHVÍL, J. Partial covers of graphs. submitted.
11. FIALA, J., KRATOCHVÍL, J., AND KLOKS, T. Fixed-parameter tractability of λ-colorings. In Graph-Theoretical Concepts in Computer Science, 25th WG '99, Ascona (1999), no. 1665 in LNCS, Springer Verlag, pp. 350-363.
12. FOTAKIS, D. A., NIKOLETSEAS, S. E., PAPADOPOULOU, V. G., AND SPIRAKIS, P. G. NP-completeness results and efficient approximations for radiocoloring in planar graphs. In MFCS (2000), no. 1893 in LNCS, Springer Verlag, pp. 363-372.
13. GEORGES, J. P., MAURO, D. W., AND WHITTLESEY, M. A. Relating path coverings to vertex labellings with a condition at distance two. Discrete Mathematics 135 (1994), 103-111.
14. GRIGGS, J. R., AND YEH, R. K. Labelling graphs with a condition at distance 2. SIAM Journal of Discrete Mathematics 5, 4 (Nov 1992), 586-595.
15. HOLYER, I. The NP-completeness of edge coloring. SIAM Journal of Computing 10, 4 (1981), 718-720.
16. KRATOCHVÍL, J. Perfect codes in general graphs. Academia Praha, 1991.
17. KRATOCHVÍL, J., PROSKUROWSKI, A., AND TELLE, J. A. Covering directed multi-graphs I. colored directed multigraphs. In Graph-Theoretical Concepts in Comp. Sci., 23rd WG '97, Berlin (1997), no. 1335 in LNCS, Springer Verlag, pp. 242-257.
18. KRATOCHVÍL, J., PROSKUROWSKI, A., AND TELLE, J. A. Covering regular graphs. Journal of Combinatorial Theory B 71, 1 (Sept 1997), 1-16.
19. KRATOCHVÍL, J., PROSKUROWSKI, A., AND TELLE, J. A. Complexity of graph covering problems. Nordic Journal of Computing 5 (1998), 173-195.
20. KRATOCHVÍL, J., and SEBÖ, A. Coloring precolored perfect graphs. Journal of Graph Theory 25, 3 (1997), 207-215.
21. KRISTIANSEN, P., AND TELLE, J. A. Generalized H-coloring of graphs. In International Symposium on Algorithms And Computation, 7th ISAAC '00, Taipei (2000), no. 1969 in LNCS, pp. 456-466. Springer Verlag,
22. LEIGHTON, F. T. Finite common coverings of graphs. Journal of Combinatorial Theory B 33 (1982), 231-238.
23. LOVÁSZ, L., AND Plummer, M. D. Matching Theory. Akademiai Kiado, Budapest, 1986.
24. SAKAI, D. Labeling chordal graphs: distance two condition. SIAM Journal of Discrete Mathematics 7, 1 (February 1994), 133-140.
25. TELLE, J. A. Complexity of domination-type problems in graphs Nordic Journal of Computing 1 (1994), 157-171.
26. VAN DEN HEUVEL, J., LEESE, R. A., AND SHEPHERD, M. A. Graph labeling and radio channel assignment. Journal of Graph Theory 29, 4 (1998), 263-283.
27. YEH, K.-C. Labeling graphs with a condition at distance two. PhD thesis, University of South Carolina, 1990.