Isometric-universal graphs for trees

DOI10.4230/LIPICS.MFCS.2025.16MaRDI QIDQ7310176zbMATH OpenFDO

Authors Edgar Baucher, François Dross, Cyril Gavoille

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.16

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Adjacency Labelling for Planar Graphs (and Beyond)
• Finding largest subtrees and smallest supertrees
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1953079 (Why is no real title available?)
• Isometric universal graphs
• Labeling schemes for nearest common ancestors through minor-universal trees
• Maximum common induced subgraph parameterized by vertex cover
• New results on linear size distance preservers
• On the complexity of various parameterizations of common induced subgraph isomorphism
• On the minimum common supergraph of two graphs
• Proof of the squashed cube conjecture
• Sparse Distance Preservers and Additive Spanners
• Sparse Sourcewise and Pairwise Distance Preservers
• Sparse universal graphs for planarity
• Universal caterpillars

This page was built for publication: Isometric-universal graphs for trees

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