On infinite bridged graphs and strongly dismantlable graphs
From MaRDI portal
DOI10.1016/S0012-365X(99)00142-9zbMATH Open0959.05100OpenAlexW2098121307MaRDI QIDQ1969784FDOQ1969784
Authors: Norbert Polat 
Publication date: 26 April 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00142-9
Recommendations
- A Helly theorem for geodesic convexity in strongly dismantlable graphs
- On dually compact closed classes of graphs and BFS-constructible graphs
- On constructible graphs, infinite bridged graphs and weakly cop-win graphs
- Dismantlability Revisited for Ordered Sets and Graphs and the Fixed-Clique Property
- A hierarchy of dismantlings in graphs
Distance in graphs (05C12) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cited In (16)
- Bucolic complexes
- Contractibility of the Kakimizu complex and symmetric Seifert surfaces
- On the null-homotopy of bridged graphs
- Fast approximation and exact computation of negative curvature parameters of graphs
- Dismantlability of weakly systolic complexes and applications
- Fixed finite subgraph theorems in infinite weakly modular graphs
- Fast approximation and exact computation of negative curvature parameters of graphs
- Constructible graphs and pursuit
- Weakly Modular Graphs and Nonpositive Curvature
- Pursuit evasion on infinite graphs
- A hierarchy of dismantlings in graphs
- On dually compact closed classes of graphs and BFS-constructible graphs
- Cops and robbers ordinals of cop-win trees
- On constructible graphs, infinite bridged graphs and weakly cop-win graphs
- Distance labeling schemes for \(K_4\)-free bridged graphs
- Graphs with convex balls
This page was built for publication: On infinite bridged graphs and strongly dismantlable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969784)
