Ear-decompositions of matching-covered graphs
- 1 March 1983
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 3 (1) , 105-117
- https://doi.org/10.1007/bf02579346
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On n-extendable graphsDiscrete Mathematics, 1980
- Independence numbers of graphs-an extension of the Koenig-Egervary theoremDiscrete Mathematics, 1979
- Regularisable graphs IDiscrete Mathematics, 1978
- On minimal elementary bipartite graphsJournal of Combinatorial Theory, Series B, 1977
- A theorem on connected graphs in which every edge belongs to a 1-factorJournal of the Australian Mathematical Society, 1974
- On the structure of factorizable graphsActa Mathematica Hungarica, 1972
- A simplified form for nearly reducible and nearly decomposable matricesProceedings of the American Mathematical Society, 1970
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- A Theorem on k-Saturated GraphsCanadian Journal of Mathematics, 1965
- The 1-factors of oriented graphsProceedings of the American Mathematical Society, 1953