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.
and Vazirani, Vijay V
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.
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.
-
Planarizing Gadgets for (k, l)-tight Graphs Do Not Exist
Planarizing gadgets do not exist for the recognition problem of (k, l)-tight graphs.
-
An Improved Construction of Variety-Evasive Subspace Families
Explicit construction of improved-size variety-evasive subspace families for degree-d varieties via better Chow-form hitting sets.