A note on 1-factors in graphs
✍ Scribed by G. Chartrand; L. Nebeský
- Publisher
- Springer Netherlands
- Year
- 1979
- Tongue
- English
- Weight
- 232 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0031-5303
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We show that if a 2-edge connected graph G has a unique f-factor F, then some vertex has the same degree in F as in G. This conclusion is the best possible, even if the hypothesis is considerably strengthened. 1. All graphs considered are finite but may contain loops and multiple edges. Let G be a
Claude Berge has given suffkient conditions under which each edge of a regular multigraph belongs to some I-factor. His proof-technique actually yields the Same conclusion under less restrictive conditions. Here we point out that this stronger version of Berge's theorem follows easily from a theorem
## Abstract An application of conservative graphs to topological graph theory is indicated.