✦ LIBER ✦

Long paths and cycles in oriented graphs

✍ Scribed by Bill Jackson

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

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

We obtain several sufficient conditions on the degrees of an oriented graph for the existence of long paths and cycles. As corollaries of our results we deduce that a regular tournament contains an edge‐disjoint Hamilton cycle and path, and that a regular bipartite tournament is hamiltonian.

📜 SIMILAR VOLUMES

Longest paths and cycles in bipartite or

Longest paths and cycles in bipartite oriented graphs

✍ Zhang Ke Min 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2). on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense. An oriented graph is a digraph without

Long paths and large cycles in finite gr

Long paths and large cycles in finite graphs

✍ Hikoe Enomoto 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 503 KB

Long dominating cycles and paths in grap

Long dominating cycles and paths in graphs with large neighborhood unions

✍ H. J. Broersma; H. J. Veldman 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB 👁 1 views

## Abstract Let __G__ be a graph of order __n__ and define __NC(G)__ = min{|__N__(__u__) ∪ __N__(__v__)| |__uv__ ∉ __E__(__G__)}. A cycle __C__ of __G__ is called a __dominating cycle__ or __D__‐__cycle__ if __V__(__G__) ‐ __V__(__C__) is an independent set. A __D__‐__path__ is defined analogously.

Hamilton cycles and paths in butterfly g

Hamilton cycles and paths in butterfly graphs

✍ Stephen A. Wong 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

## Abstract A cycle __C__ in a graph __G__ is a __Hamilton cycle__ if __C__ contains every vertex of __G__. Similarly, a path __P__ in __G__ is a __Hamilton path__ if __P__ contains every vertex of __G__. We say that __G__ is __Hamilton__‐__connected__ if for any pair of vertices, __u__ and __v__ o

Cycles in strong oriented graphs

✍ M.C. Heydemann 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Long cycles in 3-connected graphs in ori

Long cycles in 3-connected graphs in orientable surfaces

✍ Laura Sheppardson; Xingxing Yu 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

## Abstract In this article, we apply a cutting theorem of Thomassen to show that there is a function __f__: N → N such that if __G__ is a 3‐connected graph on __n__ vertices which can be embedded in the orientable surface of genus __g__ with face‐width at least __f__(__g__), then __G__ contains a