(\(k,+\))-distance-hereditary graphs

DOI10.1016/S1570-8667(03)00030-3zbMath1074.68042MaRDI QIDQ1827274

Gabriele Di Stefano, Serafino Cicerone

Publication date: 6 August 2004

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

Interconnection networksRecognition algorithmsDistance-hereditary graphsForbidden subgraphsCharacterization of graph classesDilation number

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Bipartite almost distance-hereditary graphs ⋮ Distance-hereditary digraphs ⋮ On an extension of distance hereditary graphs ⋮ Self-spanner graphs ⋮ On an extension of distance-hereditary graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Completely separable graphs
• Distance-hereditary graphs
• Graph classes between parity and distance-hereditary graphs
• Graph spanners
• A Graph Model for Fault-Tolerant Computing Systems
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• On the Fault Tolerance of Some Popular Bounded-Degree Networks
• Graph Classes: A Survey
• Fault-Tolerant Meshes with Small Degree
• Graphs with small additive stretch number
• Graphs with bounded induced distance
• Almost distance-hereditary graphs
• Compact-port routing models and applications to distance-hereditary graphs

This page was built for publication: (\(k,+\))-distance-hereditary graphs