✦ LIBER ✦

Even cycle decompositions of 4-regular graphs and line graphs

✍ Scribed by Klas Markström

Book ID: 113567545
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 367 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.12.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On 4-connected graphs without even cycle

On 4-connected graphs without even cycle decompositions

✍ Romeo Rizzi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 90 KB

P4-decompositions of regular graphs

✍ Heinrich, Katherine; Liu, Jiping; Yu, Minli 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

In this article, we show that every simple r-regular graph G admits a balanced P 4 -decomposition if r ≡ 0(mod 3) and G has no cut-edge when r is odd. We also show that a connected 4-regular graph G admits a P 4 -decomposition if and only if |E(G)| ≡ 0(mod 3) by characterizing graphs of maximum degr

Compatible circuit decompositions of 4-r

Compatible circuit decompositions of 4-regular graphs

✍ Herbert Fleischner; François Genest; Bill Jackson 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract A transition system __T__ of an Eulerian graph __G__ is a family of partitions of the edges incident to each vertex of __G__ into transitions, that is, subsets of size two. A circuit decomposition $\cal C$ of __G__ is compatible with __T__ if no pair of adjacent edges of __G__ is both a

Regular 4-critical graphs of even degree

✍ Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

## Abstract In 1960, Dirac posed the conjecture that __r__‐connected 4‐critical graphs exist for every __r__ ≥ 3. In 1989, Erdős conjectured that for every __r__ ≥ 3 there exist __r__‐regular 4‐critical graphs. In this paper, a technique of constructing __r__‐regular __r__‐connected vertex‐transiti

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

Even cycle decompositions of complete gr

Even cycle decompositions of complete graphs minus a 1-factor

✍ Brian Alspach; Susan Marshall 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 873 KB

Some sufficient conditions are proven for the complete graph of even order with a 1-factor removed to be decomposable into even length cycles. 0 1994 John Wiley & Sons, Inc. ## 1. Introduction It is natural to ask when a complete graph admits a decomposition into cycles of some fixed length. Since