✦ LIBER ✦

On hamiltonian line graphs

✍ Scribed by Lane Clark

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 191 KB
Volume: 8
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190080210

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian line graphs

✍ Richard A. Brualdi; Robert F. Shanny 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

## Abstract Sufficient conditions on the degrees of a graph are given in order that its line graph have a hamiltonian cycle.

Contractions and hamiltonian line graphs

✍ Hong-Jian Lai 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

Using the contraction method, we find a best possible condition involving the minimum degree for a triangle-free graph to have a spanning eulerian subgraph.

Line graphs of bipartite graphs with Ham

Line graphs of bipartite graphs with Hamiltonian paths

✍ Francis K. Bell 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

It is shown that, if t is an integer !3 and not equal to 7 or 8, then there is a unique maximal graph having the path P t as a star complement for the eigenvalue À2: The maximal graph is the line graph of K m,m if t ¼ 2mÀ1, and of K m,m þ1 if t ¼ 2m. This result yields a characterization of L(G ) wh

A result on Hamiltonian line graphs invo

A result on Hamiltonian line graphs involving restrictions on induced subgraphs

✍ H. J. Veldman 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by imposing certain restrictions on certain induced subgraphs of G. Thereby a number of known results on hamiltonian line graphs are improved, including the earliest results in terms of vertex degrees. O

On Hamiltonian-connected regular graphs

✍ Ioan Tomescu 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 360 KB

In this paper it is shown that any rn-regular graph of order 2rn (rn 3 3), not isomorphic to K, , , , or of order 2rn + 1 (rn even, rn 3 4), is Hamiltonian connected, which extends a previous result of Nash-Williams. As a corollary, it is derived that any such graph contains at least rn Hamiltonian

Eulerian subgraphs in 3-edge-connected g

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs

✍ Zhi-Hong Chen; Hong-Jian Lai; Xiangwen Li; Deying Li; Jinzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

## Abstract In this paper, we show that if __G__ is a 3‐edge‐connected graph with $S \subseteq V(G)$ and $|S| \le 12$, then either __G__ has an Eulerian subgraph __H__ such that $S \subseteq V(H)$, or __G__ can be contracted to the Petersen graph in such a way that the preimage of each vertex of th