Dismantlability Revisited for Ordered Sets and Graphs and the Fixed-Clique Property

DOI10.4153/CMB-1994-069-6zbMath0824.05057OpenAlexW2321952877MaRDI QIDQ4322135

John Ginsburg

Publication date: 26 October 1995

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4153/cmb-1994-069-6

zbMATH Keywords

graphhomomorphismfixed point theoremtreestriangulated graphscliquesordered setsdismantlabilitydismantlable graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (7)

s-homotopy for finite graphs ⋮ Vertex decomposable graphs and obstructions to shellability ⋮ Iterated Clique Graphs and Contractibility ⋮ Foldings in graphs and relations with simplicial complexes and posets ⋮ Contractibility and the clique graph operator ⋮ Strong homotopy types, nerves and collapses ⋮ Simplicial simple-homotopy of flag complexes in terms of graphs

This page was built for publication: Dismantlability Revisited for Ordered Sets and Graphs and the Fixed-Clique Property