𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Cycle Discrepancy of Three-Regular Graphs

✍ Scribed by Sarmad Abbasi; Laeeq Aslam

Book ID
106047900
Publisher
Springer Japan
Year
2010
Tongue
English
Weight
400 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Three-regular Subgraphs of Four-regular
Three-regular Subgraphs of Four-regular Graphs
✍ O. Moreno; V.A. Zinoviev πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 85 KB

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 subgraphs of four-regular
Three-regular subgraphs of four-regular graphs
✍ V. ChvΓ‘tal; H. Fleischner; J. Sheehan; C. Thomassen πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 553 KB

## 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

Uniqueness of maximal dominating cycles
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs
✍ Herbert Fleischner πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 461 KB πŸ‘ 2 views

## Abstract We construct 3‐regular (cubic) graphs __G__ that have a dominating cycle __C__ such that no other cycle __C__~1~ of __G__ satisfies __V(C)__ βŠ† __V__(__C__~1~). By a similar construction we obtain loopless 4‐regular graphs having precisely one hamiltonian cycle. The basis for these const