✦ LIBER ✦

Extending cycles in directed graphs

✍ Scribed by George R.T Hendry

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 536 KB
Volume: 46
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90042-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extending cycles in graphs

✍ George R.T. Hendry 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 901 KB

## A cycle C in a graph G is extendable if there exists a cycle C' in G such that V(C) E V(C') and jV(C')l = IV(C) 1 + 1. A graph G is cycle extendable if G has at least one cycle and every nonhamiltonian cycle is extendable. A graph G of order p 2 3 has a pancyclic ordering if its vertices can be

Hamilton cycles in random graphs and dir

Hamilton cycles in random graphs and directed graphs

✍ Colin Cooper; Alan Frieze 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB 👁 3 views

Extending Greene's theorem to directed g

Extending Greene's theorem to directed graphs

✍ A.J Hoffman 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Edge-disjoint cycles in regular directed

Edge-disjoint cycles in regular directed graphs

✍ Alon, Noga; McDiarmid, Colin; Molloy, Michael 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 356 KB 👁 3 views

We prove that any k-regular directed graph with no parallel edges contains a collection of at least fl(k2) edge-disjoint cycles; we conjecture that in fact any such graph contains a collection of at least ( lCi1 ) disjoint cycles, and note that this holds for k 5 3. o 1996

Hamilton cycles in directed Euler tour g

Hamilton cycles in directed Euler tour graphs

✍ Fu-ji Zhang; Xiao-feng Guo 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 516 KB

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