✦ LIBER ✦

On 2-factors with a bounded number of odd components

✍ Scribed by Diemunsch, Jennifer; Ferrara, Michael; Graffeo, Samantha; Morris, Timothy

Book ID: 121746995
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 433 KB
Volume: 323
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2014.01.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

2-factors with the bounded number of com

2-factors with the bounded number of components in line graphs

✍ Liming Xiong 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Let G be a simple graph of order n such that every vertex of degree 1 is adjacent to a vertex of degree at least 3. In this work, we prove that the line graph L(G) has a 2-factor with at most n-1 3 components if every odd branch-bond of G has a shortest branch of length 2. This is a best possible re

A lower bound for the number of blocks o

A lower bound for the number of blocks of designs with odd

✍ G. Horváth 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 197 KB

Long cycles in graphs containing a 2-fac

Long cycles in graphs containing a 2-factor with many odd components

✍ J van den Heuvel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Sharp Upper Bounds on the Minimum Number

Sharp Upper Bounds on the Minimum Number of Components of 2-factors in Claw-free Graphs

✍ Hajo Broersma; Daniël Paulusma; Kiyoshi Yoshimoto 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 617 KB

On platers with a bounded number of stat

On platers with a bounded number of states

✍ Christos H Papadimitriou 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 536 KB

On the number of components in 2-factors

On the number of components in 2-factors of claw-free graphs

✍ Kiyoshi Yoshimoto 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 267 KB