Complexes of t-colorable graphs

SIAM Journal on Discrete Mathematics

Volumn 16, Issue 3, 2003, Pages 371-389

  Linusson, Svante ^a   Shareshian, John ^b,c  

^a LINKÖPING UNIVERSITY   (Sweden)

^b Department of Biology   (United States)

^c WASHINGTON UNIVERSITY   (United States)

Author keywords

Chromatic number; Discrete Morse theory; Monotone graph property

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; POLYNOMIALS; THEOREM PROVING;

CHROMATIC NUMBER; COLORABLE GRAPHS; DISCRETE MORSE THEORY; GRAPH COMPLEXES; MONOTONE GRAPH PROPERTY;

GRAPH THEORY;

EID: 0042386228     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100366968     Document Type: Article

References (20)

1. E. Babson, A. Björner, S. Linusson, J. Shareshian, and V. Welker, Complexes of not i-connected graphs, Topology, 38 (1999), pp. 271-299.
2. A. Björner, Topological methods, in Handbook of Combinatorics, R. Graham, M. Grötschel, and L. Lovász, eds., North-Holland, Amsterdam, 1995, pp. 1819-1872.
3. A. Björner, L. Lovász, S. T. Vrećica, and R. T. Živaljevič, Chessboard complexes and matching complexes, J. London Math. Soc. (2), 49 (1994), pp. 25-39.
4. A. Bouc, Homologie de certains ensembles de 2-sous-groupes des groupes symétriques, J. Algebra, 150 (1992), pp. 158-186.
5. M. K. Chari, On discrete Morse functions and combinatorial decompositions, Discrete Math., 217 (2000), pp. 101-113.
6. M. K. Chari, preprint, Louisiana State University, Baton Rouge, LA, 1999.
7. C. Colbourn and W. Pulleyblank, Matroid Steiner problems, the Tutte polynomial and network reliability, J. Combin. Theory Ser. B, 47 (1989), pp. 20-31.
8. R. Forman, Morse theory for cell complexes, Adv. Math., 134 (1998), pp. 90-145.
9. R. Forman, Morse theory and evasiveness, Combinatorica, 20 (2000), pp. 489-504.
10. J. Jonsson, On the Homology of Some Complexes of Graphs, preprint, Stockholm University, Stockholm, Sweden, 1999.
11. J. Kahn, M. Saks, and D. Sturtevant, A topological approach to evasiveness, Combinatorica, 4 (1984), pp. 279-306.
12. n-complexes, J. Algebra, 239 (2001), pp. 77-92.
13. V. Reiner and J. Roberts, Minimal resolutions and the homology of matching and chessboard complexes, J. Algebraic Combin., 11 (2000), pp. 135-154.
14. J. Shareshian, Discrete Morse theory for complexes of 2-connected graphs, Topology, 40 (2001), pp. 681-701.
15. J. Shareshian, Links in complexes of separable graphs, J. Combin. Theory Ser. A, 88 (1999), pp. 54-65.
16. R. P. Stanley, Enumerative Combinatorics, Vol. 2, Cambridge University Press, Cambridge, UK, 1999.
17. V. Turchin, Homology of complexes of biconnected graphs, Russian Math. Surveys, 52 (1997), pp. 426-427.
18. V. Vassiliev, Complexes of connected graphs, in The Gelfand Mathematical Seminar, 1990-1992, L. Corwin et al., eds., Birkhäuser, Boston, 1993, pp. 223-235.
19. V. Vassiliev, Complements of Discriminants of Smooth Maps: Topology and Applications, revised ed., Transl. Math. Monogr. 98, AMS, Providence, RI, 1994.
20. V. Vassiliev, Topology of two-connected graphs and homology of spaces of knots, in Differential and Symplectic Topology of Knots and Curves, Amer. Math. Soc. Transl. Ser. 2 190, S. Tabachnikov, ed., AMS, Providence, RI, 1999, pp. 253-286.