For any 4-regular graph G (possibly with multiple edges), we prove that, if the number N of distinct Euler orientations of G is such that N β‘ 1 (mod 3), then G has a 3-regular subgraph. It gives the new 4-regular graphs with multiple edges which have no 3-regular subgraphs, for which we know the num
Three-regular parts of four-regular graphs
β Scribed by V. A. Tashkinov
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1984
- Tongue
- English
- Weight
- 992 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Berge conjectured that every finite simple 4βregular graph __G__ contains a 3βregular subgraph. We prove that this conjecture is true if the cyclic edge connectivity Ξ»^__c__^(__G__) of __G__ is at least 10. Also we prove that if __G__ is a smallest counterexample, then Ξ»^__c__^(__G__) i
Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a