✦ LIBER ✦

4-Regular Graphs without 3-Regular Subgraphs

✍ Scribed by LIMIN ZHANG

Book ID: 119862816
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 457 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16450.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dense Graphs without 3-Regular Subgraphs

✍ L. Pyber; V. Rodl; E. Szemeredi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 436 KB

Regular subgraphs of almost regular grap

Regular subgraphs of almost regular graphs

✍ N Alon; S Friedland; G Kalai 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 628 KB

Subgraphs of 4-Regular Planar Graphs

✍ Chris Dowden; Louigi Addario-Berry 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 645 KB

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

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

On graphs without crowns with regularμ-s

On graphs without crowns with regularμ-subgraphs

✍ V. V. Kabanov 📂 Article 📅 2000 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 662 KB