✦ LIBER ✦

The Path Partition Conjecture is true for claw-free graphs

✍ Scribed by J.E. Dunbar; M. Frick

Book ID: 108113606
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 148 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.11.065

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Path Partition Conjecture is true fo

The Path Partition Conjecture is true for some generalizations of tournaments

✍ Alan Arroyo; Hortensia Galeana-Sánchez 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 253 KB

The -conjecture for -labelings is true f

The -conjecture for -labelings is true for total graphs

✍ Ziming Duan; Pingli Lv; Lianying Miao; Zhengke Miao; Cuiqi Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 210 KB

An L(2, 1)-labeling of a graph G is defined as a function f from the vertex set V (G) into the nonnegative integers such that for any two vertices x, y, |f Griggs and Yeh conjectured that λ 2,1 (G) ≤ ∆ 2 for any simple graph with maximum degree ∆ ≥ 2. In this paper, we consider the total graph T (G