𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cyclic and cliquewise connectedness of line graphs

✍ Scribed by Christina Zamfirescu

Book ID
104113694
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
189 KB
Volume
170
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The connectivity and the line connectivity numbers of a graph and of its line graph are dependent on each other. Another important related notion is the cyclic connectedness, and we establish here a strong relationship between the cyclic connectivity number and the cyclic line connectivity number of a graph and of its line graph. Moreover, we introduce a related new notion involving cliques instead of cycles and undertake a similar investigation.

📜 SIMILAR VOLUMES

Line graphs of multigraphs and Hamilton-
Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
✍ Zdeněk Ryjáček; Petr Vrána 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 958 KB

We introduce a closure concept that turns a claw-free graph into the line graph of a multigraph while preserving its (non-)Hamiltonconnectedness. As an application, we show that every 7-connected claw-free graph is Hamilton-connected, and we show that the well-known conjecture by Matthews and Sumner

Thomassen's conjecture implies polynomia
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
✍ Roman Kužel; Zdeněk Ryjáček; Petr Vrána 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract A graph __G__ is 1‐Hamilton‐connected if __G__−__x__ is Hamilton‐connected for every __x__∈__V__(__G__), and __G__ is 2‐edge‐Hamilton‐connected if the graph __G__+ __X__ has a hamiltonian cycle containing all edges of __X__ for any __X__⊂__E__^+^(__G__) = {__xy__| __x, y__∈__V__(__G__)}

Connectedness of finite distance graphs
Connectedness of finite distance graphs
✍ Domingo Gómez-Pérez; Jaime Gutierrez; Álvar Ibeas 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB