Dismantlable graphs and posets, fixed clique property
From MaRDI portal
Publication:1331980
DOI10.1016/0012-365X(92)00518-VzbMath0811.05063MaRDI QIDQ1331980
Julien Constantin, Marie-France Bélanger, Gilles Fournier
Publication date: 26 September 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (6)
Fixed finite subgraph theorems in infinite weakly modular graphs ⋮ s-homotopy for finite graphs ⋮ Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings ⋮ Foldings in graphs and relations with simplicial complexes and posets ⋮ Algorithms for the fixed point property ⋮ Simplicial simple-homotopy of flag complexes in terms of graphs
Cites Work
- Unnamed Item
- Isotone relations and the fixed point property for posets
- Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
- Non-interval greedoids and the transposition property
- A structure theory for ordered sets
- A fixed point theorem for finite partially orderes sets
- Vertex-to-vertex pursuit in a graph
- Fixed-edge theorem for graphs with loops
- Retracts and the Fixed Point Problem for Finite Partially Ordered Sets
- Finite Topological Spaces
- Fixed points in partially ordered sets
This page was built for publication: Dismantlable graphs and posets, fixed clique property
