𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sufficient condition for all short cycles

✍ Scribed by Stephan Brandt

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
279 KB
Volume
79
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

Generalizing a result of HSiggkvist et al. (1981), we prove that every non-bipartite graph of order n with more than (n -1)*/4 + 1 edges contains cycles of every length between 3 and the length of a longest cycle.

πŸ“œ SIMILAR VOLUMES

Two sufficient conditions for dominating
Two sufficient conditions for dominating cycles
✍ Mei Lu; Huiqing Liu; Feng Tian πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 148 KB

## Abstract A cycle __C__ of a graph __G__ is dominating if each component of $G\backslash C$ is edgeless. In the paper, we will give two sufficient conditions for each longest cycle of a 3‐connected graph to be a dominating cycle. Β© 2005 Wiley Periodicals, Inc. J Graph Theory

A sufficient condition for invexity
A sufficient condition for invexity
✍ Morgan A Hanson; Norma G Rueda πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 214 KB