On infinite bridged graphs and strongly dismantlable graphs

DOI10.1016/S0012-365X(99)00142-9MaRDI QIDQ1969784zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

bridged graphstrongly dismantlable graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

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

Cited in

(16)

• Bucolic complexes
• Graphs with convex balls
• On the null-homotopy of bridged graphs
• Contractibility of the Kakimizu complex and symmetric Seifert surfaces
• Fast approximation and exact computation of negative curvature parameters of graphs
• Fixed finite subgraph theorems in infinite weakly modular graphs
• Dismantlability of weakly systolic complexes and applications
• 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

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)