scientific article; zbMATH DE number 2044923

MaRDI QIDQ4448748zbMATH OpenFDO

Authors Serafino Cicerone, Gianluca D'Ermiliis, Gabriele Di Stefano

Publication date 18 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2204/22040066.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• (\(k,+\))-distance-hereditary graphs
• On an extension of distance hereditary graphs
• On an extension of distance-hereditary graphs
• Classifying rankwidth \(k\)-dh-graphs
• Almost distance-hereditary graphs

Cited in

(6)

• On an extension of distance-hereditary graphs
• Distance labeling scheme and split decomposition
• (\(k,+\))-distance-hereditary graphs
• Networks with small stretch number
• Extended Distance-Hereditary Graphs
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible

This page was built for publication:

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