✦ LIBER ✦

Regular subpseudographs of regular pseudographs

✍ Scribed by V. A. Tashkinov

Book ID: 105095980
Publisher: SP MAIK Nauka/Interperiodica
Year: 1988
Tongue: English
Weight: 528 KB
Volume: 43
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01152554

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular packings of regular graphs

✍ A. Gutiérrez; A.S. Lladó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

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

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

Regular component decomposition of regul

Regular component decomposition of regular languages

✍ Y.J. Liu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 198 KB

A language is regular if it can be recognized by a ÿnite automaton. According to the pumping lemma, every inÿnite regular language contains a regular subset of the form uv + w, where u; v; w are words and v is not empty. It is known that every regular language can be expressed as ( i∈I uiv + i wi) ∪

Regular Subgraphs of a Regular Graph

✍ MIKIO KANO 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 214 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