Grad and classes with bounded expansion III. Restricted graph homomorphism dualities

European Journal of Combinatorics

Volumn 29, Issue 4, 2008, Pages 1012-1024

  Nešetřil, Jaroslav ^a   Ossona de Mendez, Patrice ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41549087898     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejc.2007.11.019     Document Type: Article

References (22)

1. DeVos M., Ding G., Oporowski B., Sanders D.P., Reed B., Seymour P.D., and Vertigan D. Excluding any graph as a minor allows a low tree-width 2-coloring. Journal of Combinatorial Theory Series B 91 (2004) 25-41
2. Diestel R. Graph Theory (1997), Springer-Verlag
3. Dreyer P., Malon Ch., and Nešetřil J. Universal h-colorable graphs without a given configuration. Discrete Mathematics 250 (2002) 245-252
4. B. Guenin, Edge coloring plane regular multigraphs, manuscript
5. Häggkvist R., and Hell P. Universality of A-mote graphs. European Journal of Combinatorics 14 (1993) 23-27
6. Hell P., and Nešetřil J. Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and its Applications vol. 28 (2004), Oxford University Press
7. Hubička J., and Nešetřil J. Universal partial order represented by means of trees and other simple graphs. European Journal of Combinatorics 26 5 (2005) 765-778
8. Naserasr R. Homomorphisms and edge-coloring of planar graphs. Journal of Combinatorial Theory Series B 97 3 (2007) 394-400
9. Nešetřil J. Aspects of structural combinatorics. Taiwanese Journal of Mathematics 3 4 (1999) 381-424
10. Nešetřil J., and Ossona de Mendez P. Cuts and bounds. Discrete Mathematics, Structural Combinatorics- Combinatorial and Computational Aspects of Optimization, Topology and Algebra 302 1-3 (2005) 211-224
11. J. Nešetřil, P. Ossona de Mendez, Grad and classes with bounded expansion I. Decompositions, European Journal of Combinatorics (2007), in press (doi:10.1016/j.ejc.2006.07.013)
12. J. Nešetřil, P. Ossona de Mendez, Grad and classes with bounded expansion II. Algorithmic aspects, European Journal of Combinatorics (2007), in press (doi:10.1016/j.ejc.2006.07.014)
13. Nešetřil J., and Ossona de Mendez P. Folding. Journal of Combinatorial Theory Series B 96 5 (2006) 730-739
14. Nešetřil J., and Ossona de Mendez P. Linear time low tree-width partitions and algorithmic consequences. STOC'06, Proceedings of the 38th Annual ACM Symposium on Theory of Computing (2006), ACM Press pp. 391-400
15. Nešetřil J., and Ossona de Mendez P. Tree depth, subgraph coloring and homomorphism bounds. European Journal of Combinatorics 27 6 (2006) 1022-1041
16. Nešetřil J., and Pultr A. On classes of relations and graphs determined by subobjects and factorobjects. Discrete Mathematics 22 (1978) 287-300
17. J. Nešetřil, R. Šámal, Tension continuous maps-their structure and applications, European Journal of Combinatorics (2007), in press (doi:10.1016/j.ejc.2007.11.023)
18. Nešetřil J., and Švejdarová I. Diameter of duals are linear. SIAM Journal of Discrete Mathematics 21 2 (2007) 374-384
19. Nešetřil J., and Tardif C. Duality theorems for finite structures (characterizing gaps and good characterizations). Journal of Combinatorial Theory Series B 80 (2000) 80-97
20. Nešetřil J., and Tardif C. Short answers to exponentially long questions: Extremal aspects of homomorphism duality. SIAM Journal of Discrete Mathematics 19 4 (2005) 914-920
21. Szemerédi E. Regular partitions of graphs. Colloq. Int. CNRS vol. 260 (1978) pp. 399-401
22. Thomassen C. A short list color proof of Grötzsch theorem. Journal of Combinatorial Theory Series B 88 (2003) 189-192