Distance between two k-sets and path-systems extendibility.

MaRDI QIDQ3428647zbMATH OpenFDO

Authors Ronald Gould, Thor Whalen

Publication date 29 March 2007

zbMATH Keywords

connectivitydegree constraintsdistancegraph

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 2185577
• Distance in graphs
• On the minimum distance in a \(k\)-vertex set in a graph
• On \(k\)-diameter of \(k\)-connected graphs
• Generalized eccentricity, radius, and diameter in graphs

Cited in

(6)

• Minimum degree and pan-\(k\)-linked graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• On the minimum distance in a \(k\)-vertex set in a graph
• New Ore-type conditions for H-linked graphs
• scientific article; zbMATH DE number 2185577 (Why is no real title available?)
• Subdivision extendibility

This page was built for publication: Distance between two \(k\)-sets and path-systems extendibility.

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