✦ LIBER ✦

On subpancyclic line graphs

✍ Scribed by Xiong, Liming

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 160 KB
Volume: 27
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199802)27:2<67::aid-jgt2>3.0.co;2-d

No coin nor oath required. For personal study only.

✦ Synopsis

We give a best possible Dirac-like condition for a graph G so that its line graph L(G) is subpancyclic, i.e., L(G) contains a cycle of length l for each l between 3 and the circumference of G. The result verifies the conjecture posed by Xiong (Pancyclic results in hamiltonian line graphs, in:

📜 SIMILAR VOLUMES

On line graphs of linear 3-uniform hyper

On line graphs of linear 3-uniform hypergraphs

✍ Metelsky, Yury; Tyshkevich, Regina 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

It is known that the class of line graphs of linear 3-uniform hypergraphs cannot be characterized by a finite list of forbidden induced subgraphs (R. N.

On the second largest eigenvalue of line

On the second largest eigenvalue of line graphs

✍ Petrovi?, Miroslav; Mileki?, Bojana 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB 👁 2 views

In this paper all connected line graphs whose second largest eigenvalue does not exceed 1 are characterized. Besides, all minimal line graphs with second largest eigenvalue greater than 1 are determined.

Symmetric graph designs on friendship gr

Symmetric graph designs on friendship graphs

✍ Dalibor Fronc̆ek; Alexander Rosa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

graph designs on friendship graphs.

On wing-perfect graphs

✍ Hougardy, Stefan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 342 KB

An edge in a graph G is called a wing if it is one of the two nonincident edges of an induced P 4 (a path on four vertices) in G. For a graph G, its winggraph W (G) is defined as the graph whose vertices are the wings of G, and two vertices in W (G) are connected if the corresponding wings in G belo

On critically perfect graphs

✍ Wagler, Annegret 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 337 KB

A perfect graph is critical, if the deletion of any edge results in an imperfect graph. We give examples of such graphs and prove some basic properties. We relate critically perfect graphs to well-known classes of perfect graphs, investigate the structure of the class of critically perfect graphs, a

On k-ordered graphs

✍ Jill R. Faudree; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda L 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 1 views