New irrelevant-vertex theorem for (k,d)-Folio gives linkage function ℓ(k) bounded by 2^{poly(k)}.
Fellows and Michael A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2verdicts
UNVERDICTED 2representative citing papers
Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.
citing papers explorer
-
Optimal Bounds for the k-Disjoint Paths Problem
New irrelevant-vertex theorem for (k,d)-Folio gives linkage function ℓ(k) bounded by 2^{poly(k)}.
-
Colorful Minors
Defines colorful minors on q-colored graphs and proves three structural theorems for H-colorful-minor-free graphs, a q-parameterized Erdős-Pósa classification, and FPT results for testing and colorful-minor-monotone parameters.