Almost distance-hereditary graphs

DOI10.1016/S0012-365X(00)00401-5zbMath0987.05045OpenAlexW2102241833MaRDI QIDQ5957743

Méziane Aïder

Publication date: 19 June 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00401-5

zbMATH Keywords

characterizationdistance-hereditary graphschordforbidden configurationsmetric properties

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (12)

Hamilton cycles in almost distance-hereditary graphs ⋮ Requiring adjacent chords in cycles ⋮ Distance labeling scheme and split decomposition ⋮ Bipartite almost distance-hereditary graphs ⋮ Distance-hereditary digraphs ⋮ Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws† ⋮ Hamiltonian problem on claw-free and almost distance-hereditary graphs ⋮ On an extension of distance hereditary graphs ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Self-spanner graphs ⋮ Extended Distance-Hereditary Graphs ⋮ On an extension of distance-hereditary graphs

This page was built for publication: Almost distance-hereditary graphs