Extended skew partition problem

Discrete Mathematics

Volumn 306, Issue 19-20, 2006, Pages 2438-2449

  Dantas, Simone ^a   de Figueiredo, Celina M H ^a   Gravier, Sylvain ^b   Klein, Sulamita ^a  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b CNRS   (France)

Author keywords

2 SAT; Algorithms and data structures; Computational and structural complexity; Skew partition

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

2-SAT ALGORITHM; SKEW PARTITION; STRUCTURAL COMPLEXITY;

GRAPH THEORY;

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

References (14)

1. Alon N., and Tarsi M. Colorings and orientations of graphs. Combinatorica 12 (1992) 125-134
2. Aspvall B., Plass F., and Tarjan R.E. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inform. Process. Lett. 8 (1979) 121-123
3. K. Cameron, E.M. Eschen, C.T. Hoàng, R. Sritharan, The list partition problem for graphs, in: Proceedings of SODA 2004-ACM-SIAM Symposium on Discrete Algorithms.
4. M. Chudnovsky, N. Robertson, P. Seymour, R. Thomas, Strong perfect graph theorem, in: Perfect Graph Conjecture Workshop, P. Seymour, R. Thomas, organizers, 〈http://www.aimath.org/ARCC/workshops/perfectgraph.html〉, American Institute of Mathematics, 2002.
5. Chvátal V. Star-cutsets and perfect graphs. J. Combin. Theory Ser. B 39 (1985) 189-199
6. S. Dantas, C.M.H. de Figueiredo, S. Gravier, S. Klein, On H-partition problems, Relat ́orio T ́ecnico COPPE/Engenharia de Sistemas e Computação, ES-579/02, Maio-2002.
7. de Figueiredo C.M.H., Klein S., Kohayakawa Y., and Reed B. Finding skew partitions efficiently. J. Algorithms 37 (2000) 505-521
8. Feder T., and Hell P. List homomorphisms to reflexive graphs. J. Combin. Theory Ser. B 72 (1998) 236-250
9. Feder T., Hell P., and Huang J. List homomorphisms and circular arc graphs. Combinatorica 19 (1999) 487-505
10. T. Feder, P. Hell, S. Klein, R. Motwani, Complexity of graph partition problems, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 464-472.
11. Feder T., Hell P., Klein S., and Motwani R. List partitions. SIAM J. Discrete Math. 16 (2003) 449-478
12. Fleischner H., and Stiebitz M. A solution of a coloring problem of P. Erdo{combining double acute accent}s. Discrete Math. 101 (1992) 39-48
13. Hell P., Klein S., Nogueira L.T., and Protti F. Partitioning chordal graphs into independent sets and cliques. Discrete Appl. Math. 143 (2004) 185-194
14. r's in chordal graphs, in: Proceedings of CLAIO 2002-XI Latin-Iberian American Congress of Operations Research, 2002, pp. 1-11.