✦ LIBER ✦

Cycles in strong oriented graphs

✍ Scribed by M.C. Heydemann

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 612 KB
Volume: 38
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90287-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long paths and cycles in oriented graphs

✍ Bill Jackson 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

## 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 hamilto

Hamilton cycles in strong products of gr

Hamilton cycles in strong products of graphs

✍ Daniel Král'; Jana Maxová; Robert Šámal; Pavel Podbrdský 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

## Abstract We prove that the strong product of any __n__ connected graphs of maximum degree at most __n__ contains a Hamilton cycle. In particular, __G__^Δ(__G__)^ is hamiltonian for each connected graph __G__, which answers in affirmative a conjecture of Bermond, Germa, and Heydemann. © 2005 Wile

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

The number of 4-cycles in triangle-free

The number of 4-cycles in triangle-free oriented graphs

✍ Shinsei Tazawa; Chiê Nara; John W. Moon 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 290 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

Normal fraternally orientable graphs sat

Normal fraternally orientable graphs satisfy the strong perfect graph conjecture

✍ H. Galeana-Sánchez 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 718 KB

The chromatic number x of a graph G is the minimum number of colors necessary to color the vertices of G such that no two adjacent vertices are colored alike. The clique number 01 of a graph G is the maximum number of vertices in a complete subgraph of G. A graph G is said to be perfect if x(H) =m(H