scientific article; zbMATH DE number 846953

MaRDI QIDQ4864781zbMATH OpenFDO

Authors Ladislav Nebeský

Publication date 25 February 1996

Full work available at URL https://eudml.org/doc/31495

zbMATH Keywords

connected graphshortest pathsvisibility

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 617118
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• On the set of all shortest paths of a given length in a connected graph
• On the connectivity of visibility graphs
• A general notion of visibility graphs

Cites work

• A characterization of the interval function of a connected graph
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 617118 (Why is no real title available?)

Cited in

(6)

• Geodesic visibility in graphs
• On the mutual visibility in Cartesian products and triangle-free graphs
• Geodesics and steps in a connected graph
• scientific article; zbMATH DE number 617118 (Why is no real title available?)
• On the set of all shortest paths of a given length in a connected graph
• An axiomatic approach to metric properties of connected 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 Q4864781)