✦ LIBER ✦

A Minimum Degree Result for Disjoint Cycles and Forests in Graphs

✍ Scribed by Gerald W. Schuster

Book ID: 105746895
Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 232 KB
Volume: 18
Category: Article
ISSN: 0209-9683
DOI: 10.1007/pl00009831

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge disjoint Hamilton cycles in sparse

Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at leastk

✍ Bollob�s, B.; Cooper, C.; Fenner, T. I.; Frieze, A. M. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 3 views

Let G n,m,k denote the space of simple graphs with n vertices, m edges, and minimum degree at least k, each graph G being equiprobable. Let G have property A k , if G contains (k -1)/2 edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size n/2 . We prove that, for

On a Sharp Degree Sum Condition for Disj

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

✍ Shuya Chiba; Shinya Fujita; Yunshu Gao; Guojun Li 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 217 KB

Disjoint cycles with chords in graphs

✍ Ch. Sobhan Babu; Ajit A. Diwan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract Let $n\_1,n\_2,\ldots,n\_k$ be integers, $n=\sum n\_i$, $n\_i\ge 3$, and let for each $1\le i\le k$, $H\_i$ be a cycle or a tree on $n\_i$ vertices. We prove that every graph __G__ of order at least __n__ with $\sigma\_2(G) \ge 2( n-k) -1$ contains __k__ vertex disjoint subgraphs $H\_1'

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-

Binding Number, Minimum Degree, and Cycl

Binding Number, Minimum Degree, and Cycle Structure in Graphs

✍ D. Bauer; E. Schmeichel 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

Minimum bandwidth problem for embedding

Minimum bandwidth problem for embedding graphs in cycles

✍ Lin, Yixun 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

For the bandwidth B(G) and the cyclic bandwidth B c (G) of a graph G, it is known that 1 2 B(G) °Bc (G) °B(G). In this paper, the criterion conditions for two extreme cases B c (G) Å B(G) and B c (G) Å 1 2 B(G) are studied. From this, some exact values of B c (G) for special graphs can be obtained.