scientific article; zbMATH DE number 2044923

zbMATH Open1042.68622MaRDI QIDQ4448748FDOQ4448748

Gabriele Di Stefano, Serafino Cicerone, Gianluca D'Ermiliis

Publication date: 18 February 2004

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cited In (5)

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

   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 👍 👎

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)