On distance between graphs
From MaRDI portal
Publication:367064
DOI10.1007/S00373-012-1213-8zbMATH Open1272.05038OpenAlexW2044481072MaRDI QIDQ367064FDOQ367064
Authors: Alexander Halperin, Colton Magnant, Daniel Martin 
Publication date: 26 September 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1213-8
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Density (toughness, etc.) (05C42)
Cites Work
Cited In (25)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the graph of large distances
- Title not available (Why is that?)
- Many distances in planar graphs
- The graph distance game and some graph operations
- Graph Distances in the Data-Stream Model
- Partial cubes are distance graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distances and volumina for graphs
- Title not available (Why is that?)
- On the relation between graph distance and Euclidean distance in random geometric graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preliminary results on distance-preserving graphs
- Title not available (Why is that?)
- Undirected distances and the postman-structure of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph distances using graph union
- Title not available (Why is that?)
- On distinct distance sets in a graph
This page was built for publication: On distance between graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367064)
