Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
Sanders, Bruce Reed, Paul Seymour, and Dirk Vertigan
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
UNVERDICTED 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.