𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chain Decompositions of 4-Connected Graphs

✍ Scribed by Curran, Sean; Lee, Orlando; Yu, Xingxing

Book ID
118199552
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
422 KB
Volume
19
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

r-Regular, r-connected decompositions of
r-Regular, r-connected decompositions of complete graphs
✍ H. Fleischner; W. R. Johnstone; A. J. W. Hilton 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 139 KB 👁 2 views

If rjn À 1 and rn is even, then K n can be expressed as the union of t nÀ1 r edgedisjoint isomorphic r-regular r-connected factors.

Decompositions of highly connected graph
Decompositions of highly connected graphs into paths of length 3
✍ Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

## Abstract We prove that a 171‐edge‐connected graph has an edge‐decomposition into paths of length 3 if and only its size is divisible by 3. It is a long‐standing problem whether 2‐edge‐connectedness is sufficient for planar triangle‐free graphs, and whether 3‐edge‐connectedness suffices for graph

Uncontractable 4-connected graphs
Uncontractable 4-connected graphs
✍ Nicola Martinov 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract The only uncontractable 4‐connected graphs are __C__^2^~__n__~ for __n__ ≥ 5 and the line graphs of the cubic cyclically 4‐connected graphs.

Hamiltonicity of 4-connected graphs
Hamiltonicity of 4-connected graphs
✍ Hao Li; Feng Tian; Zhi Xia Xu 📂 Article 📅 2010 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 230 KB