𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Circumference of Graphs with Bounded Degree

✍ Scribed by Chen, Guantao; Xu, Jun; Yu, Xingxing

Book ID
118181275
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
414 KB
Volume
33
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A sharp lower bound for the circumferenc
A sharp lower bound for the circumference of 1-tough graphs with large degree sums
✍ Vu Dinh Hoa πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 1 views

## Abstract We show that every 1‐tough graph __G__ on __n__ β‰₯ 3 vertices with Οƒ~3~≧ __n__ has a cycle of length at least min{__n, n__ + (Οƒ~3~/3 ) βˆ’ Ξ± + 1}, where Οƒ~3~ denotes the minimum value of the degree sum of any 3 pairwise nonadjacent vertices and Ξ± the cardinality of a miximum independent se

Degree bounds for the circumference of 3
Degree bounds for the circumference of 3-connected graphs
✍ Heinz A. Jung; Elkin Vumar πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 229 KB πŸ‘ 1 views

## Abstract Let __C__ be a longest cycle in the 3‐connected graph __G__ and let __H__ be a component of __G__β€‰βˆ’β€‰__V__(__C__) such that |__V__(__H__)| β‰₯ 3. We supply estimates of the form |__C__| β‰₯ 2__d__(__u__) + 2__d__(__v__)β€‰βˆ’β€‰Ξ±(4 ≀ α ≀ 8), where __u__,__v__ are suitably chosen non‐adjacent verti

Large 2P3-free graphs with bounded degre
Large 2P3-free graphs with bounded degree
✍ Myung S. Chung; Douglas B. West πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 541 KB

Let ex\*(D;H) be the maximum number of edges in a connected graph with maximum degree D and no induced subgraph H; this is finite if and only if H is a disjoint union of paths. If the largest component of such an H has order m, then ex\*(D;H) = O(D2ex\*(D;Pm)). Constructively, ex\*(D;qPm) = O(qD2ex\

Large P4-free graphs with bounded degree
Large P4-free graphs with bounded degree
✍ Myung S. Chung; Douglas B. West πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 424 KB

## Abstract Let __ex__ \* (__D__; __H__) denote the maximum number of edges in a connected graph with maximum degree __D__ and no induced subgraph isomorphic to __H.__ We prove that this is finite only when __H__ is a disjoint union of paths,m in which case we provide crude upper and lower bounds.