Computational complexity of compaction to reflexive cycles

SIAM Journal on Computing

Volumn 32, Issue 1, 2003, Pages 253-280

  Vikas, Narayan ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Coloring; Compaction; Computational complexity; Graph; Homomorphism; Retraction

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; CONSTRAINT THEORY; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

BIPARTITE GRAPH; GRAPH COLORING; GRAPH COMPACTION; HOMOMORPHISM; REFLEXIVE CYCLES; RETRACTION;

GRAPH THEORY;

EID: 0037942934     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539701383522     Document Type: Article

References (17)

1. H. J. Bandelt, A. Dahlmann, and H. Schutte (1987), Absolute retracts of bipartite graphs, Discrete Appl. Math., 16, pp. 191-215.
2. H. J. Bandelt, M. Farber, and P. Hell (1993), Absolute reflexive retracts and absolute bipartite retracts, Discrete Appl. Math., 44, pp. 9-20.
3. T. Feder and P. Hell (1998), List homomorphisms to reflexive graphs, J. Combin. Theory Ser. B, 72, pp. 236-250.
4. T. Feder, P. Hell, and J. Huang (1999), List homomorphisms and circular arc graphs, Combinatorica, 19, pp. 487-505.
5. T. Feder and P. Winkler (1988), manuscript.
6. F. Harary (1969), Graph Theory, Addison-Wesley, Reading, MA.
7. P. Hell (1972), Retractions de Graphes, Ph.D. thesis, Universite de Montreal, Montreal, Quebec, Canada.
8. P. Hell (1974), Retracts in graphs, in Graphs and Combinatorics, Lecture Notes in Math. 406, Springer-Verlag, Berlin, pp. 291-301.
9. P. Hell and D. J. Miller (1979), Graphs with forbidden homomorphic images, Ann. New York Acad. Sci., 319, pp. 270-280.
10. P. Hell and J. Nesetril (1990), On the complexity of H-coloring, J. Combin. Theory Ser. B, 48, pp. 92-110.
11. P. Hell and I. Rival (1987), Absolute retracts and varieties of reflexive graphs, Canad. J. Math., 39, pp. 544-567.
12. A. Karabeg and D. Karabeg (1991), Graph Compaction, in Graph Theory Notes of New York XXI, The New York Academy of Sciences, pp. 44-51.
13. A. Karabeg and D. Karabeg (1993), Graph Compaction, manuscript.
14. R. Nowakowski and I. Rival (1979), Fixed-edge theorem for graphs with loops, J. Graph Theory, 3, pp. 339-350.
15. E. Pesch (1988), Retracts of Graphs, Math. Systems Econom. 110, Athenaum, Frankfurt am Main, Germany.
16. E. Pesch and W. Poguntke (1985), A characterization of absolute retracts of n-chromatic graphs, Discrete Math., 57, pp. 99-104.
17. N. Vikas (1999), Computational complexity of compaction to cycles, in Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD.