Juniper Green recovers the Gallai-Edmonds decomposition of the divisibility graph on vertices {1,2,...,n}.
Two theorems in graph theory.Proceedings of the National Academy of Sci- ences, 43(9):842–844
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
-
Juniper Green and the Gallai-Edmonds Decomposition
Juniper Green recovers the Gallai-Edmonds decomposition of the divisibility graph on vertices {1,2,...,n}.