Subdivision yields Alexander duality on independence complexes.
Csorba, Péter (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Independence complexes and edge covering complexes via Alexander duality.”
Subdivision yields Alexander duality on independence complexes.
Directed subgraph complexes.
Hultman, Axel (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A uniform approach to complexes arising from forests.
Marietti, Mario, Testa, Damiano (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fixed simplex property for retractable complexes.
Idzik, Adam, Zapart, Anna (2010)
Fixed Point Theory and Applications [electronic only]
Similarity:
A combinatorial interpretation of homotopy groups of polyhedra
Demaria, Davide Carlo
Similarity:
Homotopy and homology in pretopological spaces
Demaria, Davide Carlo, Bogin, Garbaccio Rosanna
Similarity:
Algebraic properties of edge ideals via combinatorial topology.
Dochtermann, Anton, Engström, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a theorem of Kontsevich.
Conant, James, Vogtmann, Karen (2003)
Algebraic & Geometric Topology
Similarity:
On 3-simplicial vertices in planar graphs
Endre Boros, Robert E. Jamison, Renu Laskar, Henry Martyn Mulder (2004)
Discussiones Mathematicae Graph Theory
Similarity:
A vertex v in a graph G = (V,E) is k-simplicial if the neighborhood N(v) of v can be vertex-covered by k or fewer complete graphs. The main result of the paper states that a planar graph of order at least four has at least four 3-simplicial vertices of degree at most five. This result is a strengthening of the classical corollary of Euler's Formula that a planar graph of order at least four contains at least four vertices of degree at most five.
On the simplex graph operator
Bohdan Zelinka (1998)
Discussiones Mathematicae Graph Theory
Similarity:
A simplex of a graph G is a subgraph of G which is a complete graph. The simplex graph Simp(G) of G is the graph whose vertex set is the set of all simplices of G and in which two vertices are adjacent if and only if they have a non-empty intersection. The simplex graph operator is the operator which to every graph G assigns its simplex graph Simp(G). The paper studies graphs which are fixed in this operator and gives a partial answer to a problem suggested by E. Prisner.