List homomorphisms and circular arc graphs

Combinatorica

Volumn 19, Issue 4, 1999, Pages 487-505

  Feder, Tomas ^a   Hell, Pavol ^c   Huang, Jing ^b  

^a University of Victoria ^*  (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038929405     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004939970003     Document Type: Article

References (32)

1. B. BHATTACHARYA, P. HELL, and J. HUANG: A linear algorithm for maximum weighted cliques in proper circular arc graphs, SIAM J. Disc. Math., 9 (1996), 274-289.
2. A. BRANDSTADT: Partitions of graphs into one or two independent sets and cliques Discrete Mathematics, 152 (1996), 47-54.
3. V. CHVÁTAL: Star-cutsets and perfect graphs, J. Combin. Theory Ser. B, 39 (1985) 189-199.
4. S. A. COOK: The complexity of theorem-proving procedures, Proc. 3rd Annual ACM Symposium on Theory of Computing, (1971), 151-158.
5. C. M. H. DE FIGUEIREDO and S. KLEIN: The NP-completeness of multipartite cutset testing, Congressus Numerantium, 119 (1996), 217-222.
6. T. FEDER and P. HELL: List homomorphisms to reflexive graphs, J. Combin Theory Ser. B, 72 (1998), 236-250.
7. T. FEDER, P. HELL, and J. HUANG: List homomorphisms to general graphs, manuscript.
8. T. FEDER, P. HELL, S. KLEIN, and R. MOTWANI: Complexity of graph partition problems, Proc. 31st Annual ACM Symposium on Theory of Computing, 464-472, Atlanta, GA, May 1999.
9. T. FEDER and M. Y. VARDI: Monotone monadic SNP and constraint satisfaction, Proc. 25th Annual ACM Symposium on Theory of Computing (1993), 612-622.
10. T. GALLAI: Transitiv orientierbare graphen, Acta Math. Acad. Sci. Hungar., 18 (1967), 25-66.
11. F. GAVRIL: Algorithms on circular-arc graphs, Networks, 4 (1974), 357-369.
12. M. C. GOLUMBIC: Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
13. P. HELL: Rétractions de graphes, Ph.D. Thesis, Université de Montréal, 1972.
14. P. HELL: Retracts in graphs, in: Graphs and Combinatorics, Springer-Verlag Lecture Notes in Mathematics 406 (1974), 291-301.
15. P. HELL and J. NEŠETŘIL: On the complexity of H-colouring, J. Combin. Theory Ser. B, 48 (1990), 92-110.
16. P. HELL, J. NEŠETRIL, and X. ZHU: Complexity of tree homomorphisms, Discrete Applied Math., 70 (1996), 23-36.
17. P. HELL and J. HUANG: Two remarks on circular arc graphs, Graphs and Combinatorics, 13 (1997), 65-72.
18. P. HELL and I. RIVAL: Absolute retracts in graphs, Canad. J. Math., 39 (1987), 544-567.
19. J. KRATOCHVÍL and A. SEBÖ: Coloring precolored perfect graphs, J. Graph Theory, 25 (1997), 207-215.
20. J. KRATOCHVÍL and ZS. TUZA: Algorithmic complexity of list colorings, Discrete Applied Math., 50 (1994), 297-302.
21. C. G. LEKKERKERKER and J. CH. BOLAND: Representation of a finite graph by a set of intervals on the real line, Fund. Math., 51 (1962), 45-64.
22. R. M. MCCONNEL and J. P. SPINRAD: Linear-time modular decomposition and efficient transitive orientation of comparability graphs, Proceedings of the ACM-SIAM Symposium on Discrete Algorithms 1994, pp. 536-545.
23. E. PESCH: Retracts of Graphs, Athenaeum, Frankfurt am Main, 1988.
24. T. J. SCHAEFER: The complexity of satisfiability problems, Proc. 10th Annual ACM Symposium on Theory of Computing, (1978), 216-226.
25. J. SPINRAD: Circular-arc graphs with clique cover number two, J. Combin. Theory Ser. B, (1988), 300-306.
26. K. E. STOUFFERS: Scheduling of traffic lights - a new approach, Transportation Res., 2 (1968), 199-234.
27. R. E. TARJAN: Decomposition by clique separators, Discrete Mathematics, 55 (1985), 221-232.
28. W. T. TROTTER and J. I. MOORE: Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Discrete Math., 16 (1976), 361-381.
29. A. TUCKER: Coloring graphs with stable sets, J. Combin. Theory Ser. B, 34 (1983), 258-267.
30. A. TUCKER: Matrix characterization of circular arc graphs, Pacific J. Math, 39 (2) (1971), 535-545.
31. A. TUCKER: Colouring a family of circular arcs, SIAM J. Appl. Math., 29 (1975), 493-502.
32. S. WHITESIDES: An algorithm for finding clique cutsets, Information Processing Letters, 12 (1981), 31-32.