Small diameters of duals

SIAM Journal on Discrete Mathematics

Volumn 21, Issue 2, 2007, Pages 374-384

  Nešetřil, Jaroslav ^a   Švejdarová, Ida ^a,b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Duals; Graphs; Homomorphisms duality; Relational structures

Indexed keywords

APPLIED MATHEMATICS; DUAL GRAPHS; ORIENTED GRAPHS; RELATIONAL STRUCTURES;

GRAPH THEORY;

EID: 41549148687     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050629707     Document Type: Article

References (10)

1. P. ERDÓ́S, Graph theory and probability, Canad. J. Math., 11 (1959), pp. 34-38.
2. P. HELL AND J. NEŠETŘIL, Graphs and Homomorphisms, Oxford University Press, Oxford, 2004.
3. J. NEŠETŘIL AND P. OSSONA DE MÉNDEZ, Colouring and homomorphisms of minor-closed classes, Discrete Comput. Geom., 25 (2003), pp. 651-664.
4. J. NEŠETŘIL AND C. TARDIF, Duality theorems for finite structures (characterizing gaps and good characterizations), J. Combin. Theory Ser. B, 80 (2000), pp. 80-97.
5. J. NEŠETŘIL AND C. TARDIF, A dualistic approach to bounding the chromatic number of a graph, ITI Series, 2001-036 (2001).
6. J. NEŠETŘIL AND C. TARDIF, On maximal finite antichains in the homomorphism order of directed graphs, Discuss. Math. Graph Theory, 23 (2003), pp. 325-332.
7. J. NEŠETŘIL AND C. TARDIF, Short answers to exponentially long questions: Extremal aspects of homomorphism duality, SIAM J. Discrete Math., 19 (2005), pp. 914-920.
8. J. NEŠETŘIL AND X. ZHU, On sparse graphs with given colorings and homomorphisms, J. Combin. Theory Ser. B, 80 (2004), pp. 161-172.
9. D. SLATER, R. TARJAN, AND W. THURSTON, Rotation distance, triangulations, and hyperbolic geometry, J. Amer. Math. Soc., 1 (1988), pp. 647-681.
10. I. ŠVEJDAROVÁ, Coloring of Graphs and Dual Structures, B.Sc. thesis, Charles University, Prague, 2003 (in Czech).