✦ LIBER ✦

A new sufficient condition for hamiltonian graphs

✍ Scribed by Pierre Fraisse

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 160 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100316

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One sufficient condition for hamiltonian

One sufficient condition for hamiltonian graphs

✍ Guantao Chen 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

## Abstract Let __G__ be a 2‐connected graph of order __n.__ We show that if for each pair of nonadjacent vertices __x__,__y__ ∈ __V(G)__, then __G__ is Hamiltonian.

Sufficient conditions for a digraph to b

Sufficient conditions for a digraph to be Hamiltonian

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Li, Hao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB 👁 2 views

We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs

A chvátal–erdős type condition for hamil

A chvátal–erdős type condition for hamiltonian graphs

✍ Xiaoyun Lu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 443 KB

A sufficient condition for bipartite gra

A sufficient condition for bipartite graphs to be type one

✍ Xu, Baogang 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 2 views

The total chromatic number χ T (G) of graph G is the least number of colors assigned to V (G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χ T (G) = ∆(G) + 1.

A necessary and sufficient condition for

A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian

✍ Zhou Huai-Lu 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB 👁 2 views

We prove the following conjecture of Broersma and Veldman: A connected, locally k-connected K,,-free graph is k-hamiltonian if and only if it is (k + 2)-connected ( k L 1). We use [ 11 for basic terminology and notation, and consider simple graphs only. Let G be a graph. By V(G) and E(G) we denote,

Degree conditions for k-ordered hamilton

Degree conditions for k-ordered hamiltonian graphs

✍ Ralph J. Faudree; Ronald. J. Gould; Alexandr V. Kostochka; Linda Lesniak; Ingo S 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB 👁 1 views

## Abstract For a positive integer __k__, a graph __G__ is __k‐ordered hamiltonian__ if for every ordered sequence of __k__ vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if __G__ is a graph of order __n__ with 3 ≤ __k__ ≤ __n