A dualistic approach to bounding the chromatic number of a graph

European Journal of Combinatorics

Volumn 29, Issue 1, 2008, Pages 254-260

  Nešetřil, Jaroslav ^a   Tardif, Claude ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b UNIVERSITY OF REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (13)

1. Brown W.G., and Simonovits M. Extremal multigraph and digraph problems. Paul Erdos and His Mathematics vol. II (2002), Springer 157-204
2. Erdo{double acute}s P. Graph theory and probability. Canad. J. Math. 11 (1959) 34-38
3. Gallai T. On directed paths and circuits. Theory of Graphs. (Proc. Colloq., Tihany, 1966) (1968), Academic Press, New York 115-118
4. Hasse M. Zur algebraischen Begründung der Graphentheorie. I. Math. Nachr. 28 (1964/1965) 275-290
5. P. Komárek, Good characterizations in the class of oriented graphs, Ph.D. Thesis, Charles University, Prague, 1987 (in Czech)
6. Minty G.J. A theorem on n-coloring the points of a linear graph. Amer. Math. Monthly 69 (1962) 623-624
7. Nešetřil J. Aspects of structural combinatorics. Taiwanese J. Math. 3 4 (1999) 381-424
8. Nešetřil J., and Ossona de Mendez P. Coloring and homomorphism of minor closed classes. In: Aronov B., Basu S., Pach J., and Sharir M. (Eds). The Goodman-Pollack Festschrift. Algorithms and Combinatorics vol. 25 (2003), Springer 651-664
9. Nešetřil J., and Tardif C. Duality theorems for finite structures (characterizing gaps and good characterizations). J. Combin. Theory Ser. B 80 (2000) 80-97
10. Nešetřil J., and Tardif C. On maximal finite antichains in the homomorphism order of directed graphs. Discuss. Math. 23 2 (2003) 325-332
11. Roy B. Nombre chromatique et plus longs chemins d'un graphe. Rev. Fr. Inform. Rech. Opér. 1 (1967) 129-132
12. Sidorenko A. An analytic approach to extremal problems for graphs and hypergraphs. Bolyai Soc. Math. Stud. 3 (1991) 423-455
13. Vitaver L.M. Determination of minimal colouring of vertices of a graph by means of Boolean powers of the incidence matrix. Dokl. Akad. Nauk SSSR 147 (1962) 758-759 (in Russian)