Matrix partitions of perfect graphs

Discrete Mathematics

Volumn 306, Issue 19-20, 2006, Pages 2450-2460

  Feder, Tomás ^a   Hell, Pavol ^b  

^a Simon Fraser University ^*  (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Forbidden subgraph characterization; M partition; Matrix partition; NP complete problem; Perfect graph; Polynomial time algorithm; Trigraph homomorphism

Indexed keywords

ALGORITHMS; MATHEMATICAL TECHNIQUES; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

FORBIDDEN SUBGRAPH CHARACTERIZATION; M-PARTITION; MATRIX PARTITION; NP-COMPLETE PROBLEM; PERFECT GRAPH; POLYNOMIAL TIME ALGORITHM; TRIGRAPH HOMOMORPHISM;

GRAPH THEORY;

EID: 33748804673     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.12.035     Document Type: Article

References (22)

1. Berge C. Les problemes de coloration en theorie des graphes. Publ. Inst. Statist. Univ. Paris 9 (1960) 123-160
2. A. Brandstadt, P.L. Hammer, V.B. Le, V.V. Lozin, Bisplit graphs, DIMACS TR 2002-44.
3. K. Cameron, E.M. Eschen, C.T. Hoang, R. Sritharan, The list partition problem for graphs, SODA 2004.
4. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, The strong perfect graph theorem, eprint arXiv:math/0212070.
5. Chvátal V. Star-cutsets and perfect graphs. J. Combin. Theory, Ser. B 39 (1985) 189-199
6. de Figueiredo C.M.H., Klein S., Kohayakawa Y., and Reed B.A. Finding skew partitions efficiently. J. Algorithms 37 (2000) 505-521
7. T. Feder, P. Hell, On realizations of point determining graphs, and obstructions to full homomorphisms, manuscript.
8. T. Feder, P. Hell, Full constraint satisfaction problems, SIAM J. Comput. 36 (2006) 230-246.
9. T. Feder, P. Hell, S. Klein, R. Motwani, List partitions. SIAM J. Discrete Math. 16 (2003) 449-478.
10. T. Feder, P. Hell, S. Klein, L.T. Nogueira, F. Protti, List matrix partitions of chordal graphs, Theoret. Comput. Sci. 349 (2005) 52-66.
11. Feder T., and Vardi M. The computational structure of monotone monadic SNP and constraint satisfaction. a study through Datalog and group theory. SIAM J. Comput. 28 (1998) 236-250
12. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs (1980), Academic Press, New York
13. Hell P. Algorithmic aspects of graph homomorphisms. In: Wensley C.D. (Ed). Surveys in Combinatorics, 2003, London Mathematical Society, Lecture Note Series vol. 307 (2003), Cambridge University Press, Cambridge 239-276
14. Hell P., Klein S., Nogueira L.T., and Protti F. Partitioning chordal graphs into independent sets and cliques. Discrete Appl. Math. 141 (2004) 185-194
15. Hell P., and Nešetřil J. On the complexity of H-colouring. J. Combin. Theory, Ser. B 48 (1990) 92-110
16. Hell P., and Nešetřil J. Graphs and Homomorphisms (2004), Oxford University Press, Oxford
17. Ladner R.E. On the structure of polynomial time reducibility. J. ACM 22 (1975) 155-171
18. Lovász L. Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2 (1972) 253-267
19. McConnel R.M., and Spinrad J.P. Linear time modular decomposition and efficient transitive orientation of comparability graphs. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (1994) 536-545
20. Sumner D. Point determination in graphs. Discrete Math. 5 (1973) 179-187
21. Tarjan R.E. Decomposition by clique separators. Discrete Math. 55 (1985) 221-232
22. Whitesides S. An algorithm for finding clique cutsets. Inform. Process. Lett. 12 (1981) 31-32