Simpler adjacency labeling for planar graphs with B-Trees

DOI10.1137/1.9781611977066.3MaRDI QIDQ6538768zbMATH OpenFDO

Authors Paweł Gawrychowski

Publication date 14 May 2024

Full work available at URL https://doi.org/10.1137/1.9781611977066.3

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(3)

• Graph product structure for \(h\)-framed graphs
• Treewidth 2 in the planar graph product structure theorem
• Optimal distance labeling for permutation graphs

This page was built for publication: Simpler adjacency labeling for planar graphs with B-Trees

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