𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A minimum degree condition forcing complete graph immersion

✍ Scribed by Devos, Matt; Dvořák, Zdeněk; Fox, Jacob; McDonald, Jessica; Mohar, Bojan; Scheide, Diego

Book ID
121555525
Publisher
Springer-Verlag
Year
2014
Tongue
English
Weight
420 KB
Volume
34
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Sufficient conditions for equality of co
Sufficient conditions for equality of connectivity and minimum degree of a graph
✍ Jerzy Topp; Lutz Volkmann 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB 👁 1 views

## Abstract For a graph __G__, let __n__(__G__), κ(__G__) and δ(__G__) denote the order, the connectivity, and the minimum degree of __G__, respectively. The paper contains some conditions on __G__ implying κ(__G__) = δ(__G__). One of the conditions is that __n__(__G__) ≤ δ(__G__)(2__p__ −1)/(2__p_

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