On infinite bridged graphs and strongly dismantlable graphs
From MaRDI portal
Publication:1969784
DOI10.1016/S0012-365X(99)00142-9zbMath0959.05100OpenAlexW2098121307MaRDI QIDQ1969784
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
Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items
Contractibility of the Kakimizu complex and symmetric Seifert surfaces ⋮ Fixed finite subgraph theorems in infinite weakly modular graphs ⋮ Pursuit evasion on infinite graphs ⋮ Constructible graphs and pursuit ⋮ Fast approximation and exact computation of negative curvature parameters of graphs ⋮ Bucolic complexes ⋮ Graphs with convex balls ⋮ Cops and robbers ordinals of cop-win trees ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Dismantlability of weakly systolic complexes and applications ⋮ Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs