Isometric Universal Graphs
From MaRDI portal
Publication:4992841
DOI10.1137/21M1406155zbMath1465.05054arXiv2103.08570MaRDI QIDQ4992841
Louis Esperet, Carla Groenland, Cyril Gavoille
Publication date: 10 June 2021
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.08570
Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Asymptotically optimal induced universal graphs
- Better distance labeling for unweighted planar graphs
- Proof of the squashed cube conjecture
- Graphs which contain all small graphs
- Sublinear-space distance labeling using hubs
- A data structure for dynamic trees
- Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
- A Separator Theorem for Planar Graphs
- A Separator Theorem for Nonplanar Graphs
- Implicat Representation of Graphs
- Simpler, faster and shorter labels for distances in graphs
- Distance labeling schemes for trees
- Sublinear Distance Labeling
- Adjacency Labeling Schemes and Induced-Universal Graphs
- Distance labeling in graphs
- Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling
- Shorter Labeling Schemes for Planar Graphs
- On minimal n-universal graphs
- Optimal Distance Labeling Schemes for Trees
- Labeling Schemes for Small Distances in Trees
This page was built for publication: Isometric Universal Graphs