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.
Kottmann, Nora Tischler, and Alán Aspuru-Guzik
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Krenn-Gu conjecture verified for low-connectivity and cubic GHZ graphs; minimal counterexamples must be 4-connected.
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.
-
Krenn-Gu conjecture for sparse graphs
Krenn-Gu conjecture verified for low-connectivity and cubic GHZ graphs; minimal counterexamples must be 4-connected.