𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A spectral condition for odd cycles in graphs

✍ Scribed by Vladimir Nikiforov

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
106 KB
Volume
428
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Short odd cycles in 4-chromatic graphs
Short odd cycles in 4-chromatic graphs
✍ Nilli, A. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 163 KB πŸ‘ 3 views

It is shown that any 4-chromatic graph on n vertices contains an odd cycle of length smaller than √ 8n.

Small odd cycles in 4-chromatic graphs
Small odd cycles in 4-chromatic graphs
✍ Tao Jiang πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 50 KB

## Abstract It is shown that every 4‐chromatic graph on __n__ vertices contains an odd cycle of length less than $2\sqrt {n}\,+3$. This improves the previous bound given by Nilli [J Graph Theory 3 (1999), 145–147]. Β© 2001 John Wiley & Sons, Inc. J Graph Theory 37: 115–117, 2001

A degree sum condition for longest cycle
A degree sum condition for longest cycles in 3-connected graphs
✍ Tomoki Yamashita πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 110 KB πŸ‘ 1 views

## Abstract For a graph __G__, we denote by __d__~__G__~(__x__) and ΞΊ(__G__) the degree of a vertex __x__ in __G__ and the connectivity of __G__, respectively. In this article, we show that if __G__ is a 3‐connected graph of order __n__ such that __d__~__G__~(__x__) + __d__~__G__~(__y__) + __d__~__

Factors in graphs with odd-cycle propert
Factors in graphs with odd-cycle property
✍ Ciping Chen; Jianfang Wang πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 634 KB

Chen, C. and J. Wang, Factors in graphs with odd-cycle property, Discrete Mathematics 112 (1993) 29-40. We present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a graph G with the odd-cycle property that any two odd cycles of G either have a vertex in common or are