✦ LIBER ✦

K1,3-free and W4-free graphs

✍ Scribed by T. Kloks

Book ID: 104137288
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 234 KB
Volume: 60
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(96)00163-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique-inverse graphs of K3-free and K4-

Clique-inverse graphs of K3-free and K4-free graphs

✍ Fábio Protti; Jayme L. Szwarcfiter 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 2 views

Regular factors in K1,3-free graphs

✍ S. A. Choudum; M. S. Paulraj 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract We show that every connected __K__~1,3~‐free graph with minimum degree at least __2k__ contains a __k__‐factor and construct connected __K__~1,3~‐free graphs with minimum degree __k__ + __0__(√__k__) that have no __k__‐factor.

Hamiltonian results in K1,3-free graphs

✍ M. M. Matthews; D. P. Sumner 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB 👁 1 views

There have been a number of results dealing with Hamiltonian properties in powers of graphs. In this paper we show that the square and the total graph of a K,,,-free graph are vertex pancyclic. We then discuss some of the relationships between connectivity and Hamiltonian properties in K,.3-free gra

Longest paths and cycles in K1,3-free gr

Longest paths and cycles in K1,3-free graphs

✍ Manton M. Matthews; David P. Sumner 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 383 KB 👁 2 views

In this article w e show that the standard results concerning longest paths and cycles in graphs can be improved for K,,,-free graphs. We obtain as a consequence of these results conditions for the existence of a hamiltonian path and cycle in K,,,-free graphs.

On stable set polyhedra for K1,3-free gr

On stable set polyhedra for K1,3-free graphs

✍ Rick Giles; L.E Trotter Jr. 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Cycles of given length in some K1,3-free

Cycles of given length in some K1,3-free graphs

✍ Cun-Quan Zhang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Let G be a non-trivial connected &,-free graph. If any vertex cut of G contains a veitex v such that G@!(u)) is connected, we prove that G is pancyclic. If G(Z+I(u)) is conaected for any vertex u of G, we prove that G is vertex pancyclic and obtain a polynomial time algorithm for constructing cycles