𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Star subdivisions and connected even factors in the square of a graph

✍ Scribed by Jan Ekstein; Přemysl Holub; Tomáš Kaiser; Liming Xiong; Shenggui Zhang

Book ID
113567439
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
224 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Forbidden subgraphs and hamiitonian prop
Forbidden subgraphs and hamiitonian properties in the square of a connected graph
✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB 👁 1 views

Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the

The multiplicity of 1-factors in the squ
The multiplicity of 1-factors in the square of a graph
✍ G. R. T. Hendry 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

Several authors have shown that if G is a connected graph of even order then its square G2 has a I-factor. We show that the square of any connected graph of order 2n has at least n I-factors and describe all the extremal graphs.

The square of a connected S(K1,3)-free g
The square of a connected S(K1,3)-free graph is vertex pancyclic
✍ George Hendry; Walter Vogler 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 129 KB 👁 1 views

We prove the conjecture of Gould and Jacobson that a connected S(K1,J free graph has a vertex pancyclic square. Since .S(K1,J is not vertex pancyclic, this result is best possible. ## Our notation generally follows that used in [l] . A graph G is Hamilroniun if it contains a cycle through all its