(k,+)-distance-hereditary graphs

DOI10.1016/S1570-8667(03)00030-3zbMATH Open1074.68042MaRDI QIDQ1827274FDOQ1827274

Authors: Serafino Cicerone, Gabriele Di Stefano 

Publication date: 6 August 2004

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

Recommendations

• scientific article; zbMATH DE number 2044923
• On an extension of distance hereditary graphs
• On an extension of distance-hereditary graphs
• Distance-hereditary and strongly distance-hereditary graphs
• Distance-hereditary graphs
• Almost distance-hereditary graphs
• Distance-hereditary digraphs
• scientific article; zbMATH DE number 815104
• Equistable distance-hereditary graphs
• An exact enumeration of distance-hereditary graphs

zbMATH Keywords

Interconnection networksRecognition algorithmsDistance-hereditary graphsForbidden subgraphsCharacterization of graph classesDilation number

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Distance-hereditary digraphs
• On an extension of distance hereditary graphs
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
• Bipartite almost distance-hereditary graphs
• Self-spanner graphs
• Distance-hereditary graphs are clique-perfect
• Title not available (Why is that?)
• On an extension of distance-hereditary graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827274)