✦ LIBER ✦

An Ore-type Condition for Cyclability

✍ Scribed by Yaojun Chen; Yunqing Zhang; Kemin Zhang

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 98 KB
Volume: 22
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2001.0517

No coin nor oath required. For personal study only.

✦ Synopsis

A graph G is said to be cyclable if for each orientation D of G, there exists a set S(D) ⊆ V (G) such that reversing all the arcs with one end in S results in a Hamiltonian digraph. Let G be a simple graph of even order n ≥ 8. In this paper, we show that if the degree sum of any two nonadjacent vertices is not less than n + 1, then G is cyclable and the lower bound is sharp.

📜 SIMILAR VOLUMES

An Ore-type sufficient condition for a b

An Ore-type sufficient condition for a bipancyclic ordering

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

Ore-type condition for the existence of

Ore-type condition for the existence of connected factors

✍ Yunsun Nam 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract In this article, we obtain some Ore‐type sufficient conditions for a graph to have a connected factor with degree restrictions. Let α and __k__ be positive integers with $\alpha \ge {{k + 1} \over{k - 1}}$ if ${{k}} \ge 2$ and $\alpha \ge 4$ if ${{k}}=1$. Let __G__ be a connected graph

On graphs satisfying a local ore-type co

On graphs satisfying a local ore-type condition

✍ Asratian, A. S.; Broersma, H. J.; Van den Heuvel, J.; Veldman, H. J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 497 KB 👁 1 views

For an integer i, a graph is called an L,-graph if, for each triple of vertices u, u , w with and Khachatrian proved that connected Lo-graphs of order a t least 3 are hamiltonian, thus improving Ore's Theorem. All K1,3-free graphs are L1-graphs, whence recognizing hamiltonian L1-graphs is an NP-com

A characterization of panconnected graph

A characterization of panconnected graphs satisfying a local ore-type condition

✍ Asratian, A. S.; H�ggkvist, R.; Sarkisian, G. V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

It is well known that a graph G of orderp 2 3 is Hamilton-connected if d(u) +d(v) 2 p + 1 for each pair of nonadjacent vertices u and w. In this paper we consider connected graphs G of order at least 3 for which where N ( z ) denote the neighborhood of a vertex z. We prove that a graph G satisfying

New Ore-Type Conditions for H-Linked Gra

New Ore-Type Conditions for H-Linked Graphs

✍ Michael Ferrara; Ronald Gould; Michael Jacobson; Florian Pfender; Jeffrey Powell 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract For a fixed (multi)graph __H__, a graph __G__ is __H‐linked__ if any injection __f__: __V__(__H__)→__V__(__G__) can be extended to an __H__‐subdivision in __G__. The notion of an __H__ ‐linked graph encompasses several familiar graph classes, including __k__‐linked, __k__‐ordered and __

Ore-type degree conditions for a graph t

Ore-type degree conditions for a graph to be H-linked

✍ Alexandr V. Kostochka; Gexin Yu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 1 views

## Abstract Given a fixed multigraph __H__ with __V__(__H__) = {__h__~1~,…, __h__~m~}, we say that a graph __G__ is __H__‐linked if for every choice of __m__ vertices __v__~1~, …, ~v~~m~ in __G__, there exists a subdivision of __H__ in __G__ such that for every __i__, __v__~i~ is the branch vertex