W-state graphs are precisely the matching-covered graphs with specific half-edge colorings whose 3-connected components are W-cones, enabling efficient recognition and ruling out simple graphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set.
citing papers explorer
-
W-state graphs: Structure and Algorithms
W-state graphs are precisely the matching-covered graphs with specific half-edge colorings whose 3-connected components are W-cones, enabling efficient recognition and ruling out simple graphs.
-
Families of tractable problems with respect to vertex-interval-membership width and its generalisations
Introduces TIM width generalizing VIM width and gives meta-algorithms that characterize FPT problems including temporal Hamiltonian path and dominating set.