𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maximumk-regular induced subgraphs

✍ Scribed by Domingos M. Cardoso; Marcin Kamiński; Vadim Lozin

Publisher
Springer US
Year
2007
Tongue
English
Weight
291 KB
Volume
14
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Induced Subgraph in Random Regular Graph
Induced Subgraph in Random Regular Graph
✍ Lan XIAO; Guiying YAN; Yuwen WU; Wei REN 📂 Article 📅 2008 🏛 Academy of Mathematics and Systems Science, Chines 🌐 English ⚖ 229 KB
Note on regular subgraphs
Note on regular subgraphs
✍ R�dl, Vojtech; Wysocka, Beata 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

Let f (n, γ) denote the largest integer r such that any graph G on n vertices with γn 2 edges contains an r-regular subgraph. In this paper we prove that

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