𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On m-centers in Pt-free graphs

✍ Scribed by O. Favaron; J.L. Fouquet

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
369 KB
Volume
125
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hamiltonian results in K1,3-free graphs
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

On a Closure Concept in Claw-Free Graphs
On a Closure Concept in Claw-Free Graphs
✍ ZdenΔ›k RyjÑček πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 269 KB

If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A sufficient condition for hamiltonicity in claw-free graphs, the equiv