✦ LIBER ✦

Maximal non- hamilton-laceable graphs

✍ Scribed by Gustavus J. Simmons

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 378 KB
Volume: 5
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050410

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian-laceability of star graphs

✍ Sun-Yuan Hsieh; Gen-Huey Chen; Chin-Wen Ho 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i

Maximal Energy Graphs

✍ Jack H. Koolen; Vincent Moulton 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 65 KB

Given a graph G, its energy E G is defined as the sum of the absolute values of the eigenvalues of G. The concept of the energy of a graph was introduced in the subject of chemistry by I. Gutman, due to its relevance to the total π-electron energy of certain molecules. In this paper, we show that if

Non-Cayley tetravalent metacirculant gra

Non-Cayley tetravalent metacirculant graphs and their Hamiltonicity

✍ Dac Tan, Ngo 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 792 KB

We define three families @Z and @3 of special tetravalent metacirculant graphs and show that any non-Cayley tetravalent metacirculant graph is isomorphic to a union of disjoint copies of a graph in one of the families a2 or as. Using this result we prove further that every connected non-Cayley tetra

Maximal K3's and Hamiltonicity of 4-conn

Maximal K3's and Hamiltonicity of 4-connected claw-free graphs

✍ Jun Fujisawa; Katsuhiro Ota 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

## Abstract Let __cl__(__G__) denote Ryjáček's closure of a claw‐free graph __G__. In this article, we prove the following result. Let __G__ be a 4‐connected claw‐free graph. Assume that __G__[__N__~__G__~(__T__)] is cyclically 3‐connected if __T__ is a maximal __K__~3~ in __G__ which is also maxim

The Maximal Exceptional Graphs

✍ D. Cvetković; M. Lepović; P. Rowlinson; S.K. Simić 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 170 KB