Graphs with bounded induced distance

DOI10.1016/S0166-218X(00)00227-4zbMath0965.05040OpenAlexW1746286871MaRDI QIDQ5928866

Gabriele Di Stefano, Serafino Cicerone

Publication date: 23 July 2001

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00227-4

zbMATH Keywords

distance-hereditary graphsinduced distancestretch number

Mathematics Subject Classification ID

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

Related Items (6)

Distance labeling scheme and split decomposition ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Characterizations of Graphs with Stretch Number less than 2 ⋮ Self-spanner graphs ⋮ Extended Distance-Hereditary Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely separable graphs
• Distance-hereditary graphs
• Designing networks with compact routing tables
• Graph classes between parity and distance-hereditary graphs
• Parallel concepts in graph theory
• Transforming trees by successive local complementations
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• Interval Routing
• Graph spanners
• Decomposition of Directed Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
• Dominating cliques in distance-hereditary graphs

This page was built for publication: Graphs with bounded induced distance