Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
Optimal induced universal graphs and adjacency labeling for trees.J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Adjacency labelling for proper minor-closed graph classes
Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.