Retract‐collapsible graphs and invariant subgraph properties

DOI10.1002/jgt.3190190105zbMath0810.05064OpenAlexW2119577521MaRDI QIDQ4320464

Norbert Polat

Publication date: 1 February 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190105

zbMATH Keywords

dismantlingsimplexinvariant subgraph propertiescop-winball-Helly graphcompacity propertyretract-collapsiblesubretract- collapsible graphs

Mathematics Subject Classification ID

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

Related Items (10)

Fixed finite subgraph theorems in infinite weakly modular graphs ⋮ A Helly theorem for geodesic convexity in strongly dismantlable graphs ⋮ Pursuit evasion on infinite graphs ⋮ Constructible graphs and pursuit ⋮ Stable graphs for a family of endomorphisms ⋮ Invariant Hamming graphs in infinite quasi-median graphs ⋮ On the extension of vertex maps to graph homomorphisms ⋮ Large classes of infinite k-cop-win graphs ⋮ Netlike partial cubes, IV: Fixed finite subgraph theorems ⋮ Algorithms for the fixed point property

This page was built for publication: Retract‐collapsible graphs and invariant subgraph properties