✦ LIBER ✦

Long cycles in graphs with large degree sums

✍ Scribed by Douglas Bauer; H.J. Veldman; A. Morgana; E.F. Schmeichel

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 764 KB
Volume: 79
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90055-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Long cycles in graphs with large degree

Long cycles in graphs with large degree sums and neighborhood unions

✍ Van den Heuvel, J. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 801 KB

We present and prove several results concerning the length of longest cycles in 2connected or I-tough graphs with large degree sums. These results improve many known results on long cycles in these graphs. We also consider the sharpness of the results and discuss some possible strengthenings.

Relative length of long paths and cycles

Relative length of long paths and cycles in graphs with large degree sums

✍ Hikoe Enomoto; Jan van den Heuvel; Atsushi Kaneko; Akira Saito 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 601 KB

## Abstract For a graph __G, p__(__G__) denotes the order of a longest path in __G__ and __c__(__G__) the order of a longest cycle. We show that if __G__ is a connected graph __n__ ≥ 3 vertices such that __d__(__u__) + __d__(__v__) + __d__(__w__) ≧ n for all triples __u, v, w__ of independent verti

Long cycles, degree sums and neighborhoo

Long cycles, degree sums and neighborhood unions

✍ H.J. Broersma; J.van den Heuvel; H.J. Veldman 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 747 KB

Cycles and paths in graphs with large mi

Cycles and paths in graphs with large minimal degree

✍ V. Nikiforov; R. H. Schelp 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

## Abstract Let __G__ be a simple graph of order __n__ and minimal degree > cn (0 < c < 1/2). We prove that (1) There exist __n__~0~ = __n__~0~(__c__) and __k__ = __k__(__c__) such that if __n__ > __n__~0~ and __G__ contains a cycle __C__~__t__~ for some __t__ > 2__k__, then __G__ contains a cycle

Cycle lengths in graphs with large minim

Cycle lengths in graphs with large minimum degree

✍ V. Nikiforov; R. H. Schelp 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

## Abstract Our main result is the following theorem. Let __k__ ≥ 2 be an integer, __G__ be a graph of sufficiently large order __n__, and __δ__(__G__) ≥ __n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__ ∈ [4, __δ__(__G__) + 1]. If __G__ is nonbipartite then

Cycles through prescribed vertices with

Cycles through prescribed vertices with large degree sum

✍ Katsuhiro Ota 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 366 KB