𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Component efficient solutions in line-graph games with applications

✍ Scribed by René van den Brink; Gerard van der Laan; Valeri Vasil’ev

Book ID
105866626
Publisher
Springer
Year
2006
Tongue
English
Weight
171 KB
Volume
33
Category
Article
ISSN
0938-2259

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