On constructible graphs, infinite bridged graphs and weakly cop-win graphs
From MaRDI portal
Publication:1586757
DOI10.1016/S0012-365X(00)00127-8zbMath0961.05066OpenAlexW2011663983MaRDI QIDQ1586757
François Laviolette, Norbert Polat, Marc Chastand
Publication date: 5 March 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00127-8
Related Items (11)
The algebra of metric betweenness. I: Subdirect representation and retraction ⋮ Pursuit evasion on infinite graphs ⋮ Constructible graphs and pursuit ⋮ On the cop number of generalized Petersen graphs ⋮ Beyond Helly graphs: the diameter problem on absolute retracts ⋮ Bucolic complexes ⋮ A story of diameter, radius, and (almost) Helly property ⋮ Distance problems within Helly graphs and \(k\)-Helly graphs ⋮ An annotated bibliography on guaranteed graph searching ⋮ On geodesic structures of weakly median graphs. I. Decomposition and octahedral graphs ⋮ Large classes of infinite k-cop-win graphs
This page was built for publication: On constructible graphs, infinite bridged graphs and weakly cop-win graphs
