Studying twists of edges in embeddings of cubic graphs yields bounds on the number of singular edges.
Perfect Matching for Biconnected Cubic Graphs in O(n ^2n) Time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Facial diagrams and cycle double cover
Studying twists of edges in embeddings of cubic graphs yields bounds on the number of singular edges.