A theorem on connected graphs in which every edge belongs to a 1-factor

DOI10.1017/S144678870002913XzbMath0289.05125OpenAlexW2085270840MaRDI QIDQ4777332

Charles H. C. Little

Publication date: 1974

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s144678870002913x

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Related Items (8)

Thin edges in braces ⋮ Matching covered graphs with three removable classes ⋮ On n-extendable graphs ⋮ On defect-d matchings in graphs ⋮ On generalizations of matching-covered graphs ⋮ On minimal elementary bipartite graphs ⋮ Circuit decompositions of join-covered graphs ⋮ Ear-decompositions of matching-covered graphs

Cites Work

• Unnamed Item

This page was built for publication: A theorem on connected graphs in which every edge belongs to a 1-factor