✦ LIBER ✦

Some recent results in hamiltonian graphs

✍ Scribed by L. Lesniak-Foster

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 505 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010109

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A variety of recent developments in hamiltonian theory are reviewed. In particular, several sufficient conditions for a graph to be hamiltonian, certain hamiltonian properties of line graphs, and various hamiltonian properties of powers of graphs are discussed. Furthermore, the concept of an n‐distant hamiltonian graph is introduced and several theorems involving this special class of hamiltonian graphs are presented.

📜 SIMILAR VOLUMES

Hamiltonian results in K1,3-free graphs

✍ M. M. Matthews; D. P. Sumner 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 357 KB 👁 1 views

There have been a number of results dealing with Hamiltonian properties in powers of graphs. In this paper we show that the square and the total graph of a K,,,-free graph are vertex pancyclic. We then discuss some of the relationships between connectivity and Hamiltonian properties in K,.3-free gra

Hamiltonian ?-factors in graphs

✍ Wei, Bing; Zhu, Yongjin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

Let k ≥ 2 be an integer. A k-factor F of a graph G is called a hamiltonian k-factor if F contains a hamiltonian cycle. In this paper, we shall prove that if G is a graph of order n with k ≥ 2, n ≥ 8k -4, kn even and δ(G) ≥ n/2, then G has a hamiltonian k-factor.

Some Recent Results in Organofluorine Ch

Some Recent Results in Organofluorine Chemistry

✍ André Laurent 📂 Article 📅 2010 🏛 Wiley (John Wiley & Sons) ⚖ 260 KB 👁 2 views

Some results about f-critical graphs

✍ Guizhen Liu; Jianfeng Hou; Jiansheng Cai 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

Some 3-connected 4-edge-critical non-Ham

Some 3-connected 4-edge-critical non-Hamiltonian graphs

✍ Yang Yuansheng; Zhao Chengye; Lin Xiaohui; Jiang Yongsong; Hao Xin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB 👁 1 views

## Abstract Let γ(__G__) be the domination number of graph __G__, thus a graph __G__ is __k__‐edge‐critical if γ (__G__) = k, and for every nonadjacent pair of vertices __u__ and υ, γ(__G__ + __u__υ) = k−1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjectu

Hamiltonian cycles in n-extendable graph

Hamiltonian cycles in n-extendable graphs

✍ Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract A graph __G__ of order at least 2__n__+2 is said to be __n__‐extendable if __G__ has a perfect matching and every set of __n__ independent edges extends to a perfect matching in __G__. We prove that every pair of nonadjacent vertices __x__ and __y__ in a connected __n__‐extendable graph