✦ LIBER ✦

Contractible cycles in graphs with large minimum degree

✍ Scribed by Yoshimi Egawa

Book ID: 108316044
Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 717 KB
Volume: 171
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00017-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Long cycles in graphs with large degree

Long cycles in graphs with large degree sums

✍ Douglas Bauer; H.J. Veldman; A. Morgana; E.F. Schmeichel 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Subdivisions of graphs with large minimu

Subdivisions of graphs with large minimum degree

✍ Carsten Thomassen 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 1 views

Long cycles in graphs with prescribed to

Long cycles in graphs with prescribed toughness and minimum degree

✍ Douglas Bauer; H.J. Broersma; J. van den Heuvel; H.J. Veldman 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A cycle C of a graph G is a D~-cycle if every component of G-V(C) has order less than 2. Using the notion of D~-cycles, a number of results are established concerning long cycles in graphs with prescribed toughness and minimum degree. Let G be a t-tough graph on n/> 3 vertices. If 6 > n/(t + 2) + 2-

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

Contractible Cycles in Graphs with Girth

Contractible Cycles in Graphs with Girth at Least 5

✍ Yoshimi Egawa 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Let k 3 be an integer. We show that if G is a k-connected graph with girth at least 5, then G has an induced cycle Q such that G&V(Q) is (k&1)-connected. 1998 Academic Press ## 1. Introduction By a graph, we mean a finite, undirected, simple graph with no loops and no multiple edges. Let G=(V(G