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
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
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.