Combinatorics and Geometry of Finite and Infinite Squaregraphs
From MaRDI portal
Publication:3013137
DOI10.1137/090760301zbMath1221.05068arXiv0905.4537OpenAlexW2074250003WikidataQ29300757 ScholiaQ29300757MaRDI QIDQ3013137
David Eppstein, Victor Chepoi, Hans-Jürgen Bandelt
Publication date: 18 July 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.4537
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance geometry (51K99) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (13)
On minimum spanning tree-like metric spaces ⋮ The product structure of squaregraphs ⋮ Subquadratic-time algorithm for the diameter and all eccentricities on median graphs ⋮ Track Layout Is Hard ⋮ Planar median graphs and cubesquare-graphs ⋮ Ramified rectilinear polygons: coordinatization by dendrons ⋮ On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Track layouts, layered path decompositions, and leveled planarity ⋮ Cubic Planar Graphs that cannot be Drawn on few Lines ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ From modular decomposition trees to rooted median graphs ⋮ Manhattan orbifolds
This page was built for publication: Combinatorics and Geometry of Finite and Infinite Squaregraphs
