A near-linear-time algorithm finds a well-spread perfect matching in bridgeless cubic graphs by using a cactus representation of 2-edge-cuts with efficient updates under reductions.
SIAM Journal on Discrete Mathematics , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Studying twists of edges in embeddings of cubic graphs yields bounds on the number of singular edges.
citing papers explorer
-
A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
A near-linear-time algorithm finds a well-spread perfect matching in bridgeless cubic graphs by using a cactus representation of 2-edge-cuts with efficient updates under reductions.
-
Facial diagrams and cycle double cover
Studying twists of edges in embeddings of cubic graphs yields bounds on the number of singular edges.