On isometric subgraphs of infinite bridged graphs and geodesic convexity

DOI10.1016/S0012-365X(01)00097-8zbMath0995.05045MaRDI QIDQ1349108

Norbert Polat

Publication date: 21 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

infinite graphgeodesic convexitybridged graphisometric subgraphdominated vertexconstructible graphdiscrete deformation retractstrong dismantlable graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (7)

Bucolic complexes ⋮ The convex and weak convex domination number of convex polytopes ⋮ Graphs with convex balls ⋮ A centrality notion for graphs based on Tukey depth ⋮ A GENERAL POSITION PROBLEM IN GRAPH THEORY ⋮ Dismantlability of weakly systolic complexes and applications ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs

This page was built for publication: On isometric subgraphs of infinite bridged graphs and geodesic convexity