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.
Dreyfus and Robert A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Power network design variants of Steiner Tree are W[1]-hard parameterized by terminals, with XP algorithms for planar low-voltage cases and FPT results under a modified cost model.
citing papers explorer
-
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.
-
Parameterized Complexity of Power Network Design: Coordinating Cable Placement is Hard
Power network design variants of Steiner Tree are W[1]-hard parameterized by terminals, with XP algorithms for planar low-voltage cases and FPT results under a modified cost model.