✦ LIBER ✦

Regular subgraphs of almost regular graphs

✍ Scribed by N Alon; S Friedland; G Kalai

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 628 KB
Volume: 37
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90047-9

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

Regular factors in vertex-deleted subgra

Regular factors in vertex-deleted subgraphs of regular graphs

✍ P. Katerinis 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Let G be a 2r-regular, 2r-edge-connected graph of odd order and m be an integer such that 1 2rw(W)+2ec(S',S')-2 c d,-&)+2rlS'I. ES' (12) But CxsS' ## dc-o(x)=&sS dG-D(x)+dc-&)=CXEs dG,-D(x)+e&,S)+dG-&). Thus (12) implies, ## 2rIDI>2ro(W)+2eG(S',S')-2 c dc,-o(x)+e,(u,S)+d,-,(u) +WS'I. XC.7

Almost-regular factorization of graphs

✍ Jin Akiyama; Mikio Kano 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

For integers a and b, 0 s a s b, an [a,bl-graph G satisfies a s deg(x,G) s b for every vertex x of G, and an [a.bl-factor is a spanning subgraph its edges can be decomposed into [a,bl-factors. When both k and tare positive integers and s is a nonnegative integer, w e prove that every [(12k + 2)t +

Dense Graphs without 3-Regular Subgraphs

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

Almost regular edge colorings and regula

Almost regular edge colorings and regular decompositions of complete graphs

✍ Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract For __k__ = 1 and __k__ = 2, we prove that the obvious necessary numerical conditions for packing __t__ pairwise edge‐disjoint __k__‐regular subgraphs of specified orders __m__~1~,__m__~2~,… ,__m__~t~ in the complete graph of order __n__ are also sufficient. To do so, we present an edge