𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Three-regular path pairable graphs

✍ Scribed by Ralph J. Faudree; András Gyárfás; Jenö Lehel

Publisher
Springer Japan
Year
1992
Tongue
English
Weight
423 KB
Volume
8
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular path decompositions of odd regul
Regular path decompositions of odd regular graphs
✍ Odile Favaron; François Genest; Mekkia Kouider 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract Kotzig asked in 1979 what are necessary and sufficient conditions for a __d__‐regular simple graph to admit a decomposition into paths of length __d__ for odd __d__>3. For cubic graphs, the existence of a 1‐factor is both necessary and sufficient. Even more, each 1‐factor is extendable

Long path connectivity of regular graphs
Long path connectivity of regular graphs
✍ Cun-Quan Zhang; Yong-Jin Zhu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Zhang, C.-Q. and Y.-J. Zhu, Long path connectivity of regular graphs, Discrete Mathematics 96 (1991) 151-160. Any pair of vertices in a 4-connected path or a path of length at least 3k-6. non-bipartite k-regular graph are joined bY a Hamilton \* This research was partially supported by AFOSR under g

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