The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in R^n

DOI10.1134/S1064562416010221zbMATH Open1339.05208MaRDI QIDQ294338FDOQ294338

Authors: Z. N. Ovsyannikov 

Publication date: 16 June 2016

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

Recommendations

• Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric
• On The Edge Geodetic Number Of A Graph
• On the edge set of graphs of lattice paths
• Sets admitting connection by graphs of finite length
• An extremal problem for paths in bipartite graphs

zbMATH Keywords

computer calculations

Mathematics Subject Classification ID

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

Cites Work

• A missing prime configuration in the Hausdorff metric geometry
• Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric
• Fibonacci sequences and the space of compact sets

Cited In (3)

• A canonical parameterization of paths in $\mathbb{R}^n$
• Local structure of Gromov-Hausdorff space around generic finite metric spaces
• Title not available (Why is that?)

This page was built for publication: The number of edge covers of bipartite graphs or of shortest paths with fixed endpoints in the space of compact sets in \(R^n\)

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