On digraph coloring problems and treewidth duality

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 106-115

  Atserias, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEM (CSP); DIGRAPH COLORING PROBLEM; FIRST-ORDER LOGIC; TREEWIDTH DUALITY;

COLOR; CONSTRAINT THEORY; FORMAL LOGIC; PROBLEM SOLVING; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 26844546278     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2005.31     Document Type: Conference Paper

References (29)

1. M. Ajtai and Y. Gurevich. Datalog vs. first-order logic. Journal of Computer and System Sciences, 49(3):562-588, 1994.
2. A. Atserias. On sufficient conditions for unsatisfiability of random formulas. Journal of the ACM, 51(2):281-311, 2004. Preliminary version in LICS 2002.
3. A. Atserias and V. Dalmau. A combinatorial characterization of resolution width. In 18th IEEE Conference on Computational Complexity, pages 239-247, 2003.
4. A. Atserias, A. Dawar, and Ph. G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries. In 31st Annual ACM-SIGACT-SIGACT Symposium on Principles of Database Systems, 2004.
5. E. Ben-Sasson and A. Wigderson. Short proofs are narrow-resolution made simple. Journal of the ACM, 48(2):149-169, 2001.
6. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1-45, 1998.
7. A. Bulatov. Malt'sev constraints are tractable. Technical report PRG-RR-02-05, Oxford University, 2002.
8. E. Dalhaus. Reduction to NP-complete problems by interpretations. In E. Börger, Rödding, and Hasenjaeger, editors, Logic and Machines: Decision Problems and Complexity, volume 171 of Lecture Notes in Computer Science, pages 357-365. Springer-Verlag, 1984.
9. V. Dalmau, Ph. G. Kolaitis, and M. Y. Vardi. Constraint satisfaction, bounded treewidth, and finite variable logics. In 8th International Conference on Principles and Practice of Constraint Programming (CP), volume 2470 of Lecture Notes in Computer Science, pages 310-326. Springer, 2002.
10. V. Dalmau, A. Krokhin, and B. Larose. First-order retraction problems for posets and reflexive graphs. In 19th IEEE Symposium on Logic in Computer Science, 2004.
11. T. Feder and M. Vardi. Homomorphism closed vs. existential positive. In 18th IEEE Symposium on Logic in Computer Science, pages 311-320, 2003.
12. T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing, 28(1):57-104, 1998.
13. W. Gutjahr, W. Welzl, and G. Woeginger. Polynomial graph-colorings. Discrete Applied Mathematics, 35:29-45, 1992.
14. P. Hell and J. Nešetřil. On the complexity of H-coloring. Journal of Combinatorial Theory, 48:92-119, 1990.
15. P. Hell and J. Něsetřil. Graph Homomorphisms. Oxford University Press, 2003.
16. P. Hell, J. Nešetřil, and X. Zhu. Complexity of tree homomorphisms. Discrete Applied Mathematics, 70:2336, 1996.
17. P. Hell, J. Nešetřil, and X. Zhu. Duality and polynomial testing of tree homomorphisms. Transactions of the American Mathematical Society, 348(4): 1281-1297, 1996.
18. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-548, 1997.
19. Ph. G. Kolaitis and M. Y. Vardi. 0-1 laws and decision problems for fragments of second-order logic. Information and Computation, 87:302-338, 1990.
20. Ph. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61(2):302-332, 2000.
21. B. Larose and L. Zádori. Bounded width problems and algebras. Manuscript, 2004.
22. J. Nešetřil. Aspects of structural combinatorics (graph homomorphisms and their use). Taiwanese Journal of Mathematics, 3:381-423, 1999.
23. J. Nešetřil and V. Rödl. Chromatically optimal rigid graphs. Journal of Combinatorial Theory Series B, 46:133-141, 1989.
24. J. Nešetřil and C. Tardif. Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combininatorial Theory Series B, 80:80-97, 2000.
25. J. Nešetřil and Z. Zhu. On bounded treewidth duality of graphs. Journal of Graph Theory, 23:151-162, 1996.
26. B. Rossman. Existential positive types and preservation under homomorphisms. In 20th IEEE Symposium on Logic in Computer Science, 2005.
27. T. J. Schaefer. The complexity of satisfability problems. In 10th Annual ACM Symposium on the Theory of Computing, pages 216-226, 1978.
28. P. D. Seymour and R. Thomas. Graph searching and a minimax theorem for treewidth. Technical Report 89-1, DIMACS, 1989.
29. J. D. Ullman. Database and knowledge-base systems. Computer Science Press, 1989.