Characterizations of graphs with stretch number less than 2

DOI10.1016/J.ENDM.2011.05.064MaRDI QIDQ2840738zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone

Publication date 23 July 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2011.05.064

zbMATH Keywords

cycle-chord conditionsdistance-hereditary graphsforbidden subgraphsgraph characterizationsstretch number

Mathematics Subject Classification ID

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

Recommendations

• On an extension of distance hereditary graphs
• Graphs with bounded induced distance
• On an extension of distance-hereditary graphs
• A characterization of 3-Steiner distance hereditary graphs
• Distance-hereditary and strongly distance-hereditary graphs

Cites work

• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Distance-hereditary graphs
• Graphs with bounded induced distance
• Hole and antihole detection in graphs
• Networks with small stretch number

Cited in

(5)

• On an extension of distance hereditary graphs
• Distance-hereditary and strongly distance-hereditary graphs
• A characterization of 3-Steiner distance hereditary graphs
• Graphs with small additive stretch number
• Graphs with bounded induced distance

This page was built for publication: Characterizations of graphs with stretch number less than 2

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