Optimal induced universal graphs for bounded-degree graphs

DOI10.1137/1.9781611974782.74zbMath1410.05097arXiv1607.03234OpenAlexW4230492344WikidataQ105584136 ScholiaQ105584136MaRDI QIDQ4575816

Rajko Nenadov, Noga Alon

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.03234

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (7)

Better distance labeling for unweighted planar graphs ⋮ Adjacency Labeling Schemes and Induced-Universal Graphs ⋮ Unnamed Item ⋮ Induced Universal Hypergraphs ⋮ Better distance labeling for unweighted planar graphs ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Fault-tolerant distance labeling for planar graphs

This page was built for publication: Optimal induced universal graphs for bounded-degree graphs