Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
33 Kung-Jui Pai and Jou-Ming Chang
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DM 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Completely independent Steiner trees are defined as a generalization of completely independent spanning trees and internally disjoint Steiner trees, accompanied by characterizations, bounds, algorithms, hardness results, and applications to planar graphs and bounded-treewidth graphs plus a directed-
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.
-
Completely Independent Steiner Trees
Completely independent Steiner trees are defined as a generalization of completely independent spanning trees and internally disjoint Steiner trees, accompanied by characterizations, bounds, algorithms, hardness results, and applications to planar graphs and bounded-treewidth graphs plus a directed-