Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
[Kur30] Kazimierz Kuratowski
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
The size of minimal excluded minors for a surface of genus g is O(g^{8+ε}).
In planar and bounded-genus graphs, absence of k pairwise d-far S-T paths implies a vertex set of size f(d,k) whose d-neighborhood intersects every S-T path.
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.
-
A polynomial bound for the minimal excluded minors for a surface
The size of minimal excluded minors for a surface of genus g is O(g^{8+ε}).
-
A coarse Menger's Theorem for planar and bounded genus graphs
In planar and bounded-genus graphs, absence of k pairwise d-far S-T paths implies a vertex set of size f(d,k) whose d-neighborhood intersects every S-T path.