Total cut complexes of graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 16165 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- Combinatorial algebraic topology
- Combinatorics and commutative algebra.
- Complexes of graphs with bounded independence number
- Complexes oft-Colorable Graphs
- Decompositions of Simplicial Complexes Related to Diameters of Convex Polyhedra
- Elementary topology: problem textbook
- Higher independence complexes of graphs and their homotopy types
- Introduction to topological manifolds
- Matching complexes of trees and applications of the matching tree algorithm
- Morse theory for cell complexes
- On Lexicographically Shellable Posets
- Poset topology: tools and applications
- Resolutions of Stanley-Reisner rings and Alexander duality
- Semigroup rings and simplicial complexes
- Shellable nonpure complexes and posets. II
- Simplicial complexes of graphs
- Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings
- Topology of cut complexes of graphs
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
Cited in
(3)
This page was built for publication: Total cut complexes of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7025757)