✦ LIBER ✦

The strongest monotone degree condition for n-connectedness of a graph

✍ Scribed by F.T Boesch

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 170 KB
Volume: 16
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90058-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sufficient degree conditions for k-edge-

Sufficient degree conditions for k-edge-connectedness of a graph

✍ D. Bauer; S.L. Hakimi; N. Kahl; E. Schmeichel 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

A degree condition for the circumference

A degree condition for the circumference of a graph

✍ Nathaniel Dean; Pierre Fraisse 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 1 views

We present a new condition on the degree sums of a graph that implies the existence of a long cycle. Let c(G) denote the length of a longest cycle in the graph G and let rn be any positive integer. Suppose G is a 2-connected graph with vertices x,, . . . , x, and edge set E that satisfies the proper

A degree condition for the existence of

A degree condition for the existence of regular factors inK1,n-free graphs

✍ Ota, Katsuhiro; Tokuda, Taro 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 2 views

A graph is called K1,.-free if it contains no K l , n as an induced subgraph. Let n ( r 3), r be integers (if r is odd, r 2 n -1). We prove that every Kl,,-free connected graph G with rlV(G)I even has an r-factor if its minimum degree is at least This degree condition is sharp.

A sufficient condition for equality of e

A sufficient condition for equality of edge-connectivity and minimum degree of a graph

✍ Donald L. Goldsmith; Roger C. Entringer 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Let __G__ be a connected graph of order __p__ ≥ 2, with edge‐connectivity κ~1~(__G__) and minimum degree δ(__G__). It is shown her ethat in order to obtain the equality κ~1~(__G__) = δ(__G__), it is sufficient that, for each vertex __x__ of minimum degree in __G__, the vertices in the n

A Degree Sum Condition for the Existence

A Degree Sum Condition for the Existence of a Contractible Edge in a κ-Connected Graph

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is known that a noncomplete }-connected graph of minimum degree of at least w 5} 4 x contains a }-contractible edge, i.e., an edge whose contraction yields again a }-connected graph. Here we prove the stronger statement that a noncomplete }-connected graph for which the sum of the degrees of any

The maximum size of graphs satisfying a

The maximum size of graphs satisfying a degree condition

✍ Yiping Qiu; Xiao Feng Jia 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Let G be a simple graph of order n without isolated vertices. If the integer h satisfies In this note the maximum size of Sri(h)--graphs is determined. A result of Krol and Veldman on critically h-connected graphs follows as a corollary.