A uniform approach to complexes arising from forests.
Marietti, Mario, Testa, Damiano (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Subdivision yields Alexander duality on independence complexes.”
A uniform approach to complexes arising from forests.
Independence complexes and edge covering complexes via Alexander duality.
Kawamura, Kazuhiro (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Independence complexes of stable Kneser graphs.
Braun, Benjamin (2011)
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 Contribution to my Article: 'Introducing an Orientation into a Given Non-Directed Graph'
Bohdan Zelinka (1967)
Matematický časopis
Similarity:
Analoga of Menger's theorem for polar and polarized graphs
Bohdan Zelinka (1976)
Czechoslovak Mathematical Journal
Similarity:
On the Vertex Separation of Maximal Outerplanar Graphs
Markov, Minko (2008)
Serdica Journal of Computing
Similarity:
We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.