𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal Graphs without Cycles of Length 8 or Less

✍ Scribed by Kim Marshall; Mirka Miller; Joe Ryan

Book ID
119236621
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
183 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Extremal graphs without three-cycles or
Extremal graphs without three-cycles or four-cycles
✍ David K. Garnick; Y. H. Harris Kwong; Felix Lazebnik πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 594 KB

## Abstract We derive bounds for __f(v)__, the maximum number of edges in a graph on __v__ vertices that contains neither three‐cycles nor four‐cycles. Also, we give the exact value of __f(v)__ for all __v__ up to 24 and constructive lower bounds for all __v__ up to 200. Β© 1993 John Wiley & Sons, I

Planar Graphs Without Cycles of Specific
Planar Graphs Without Cycles of Specific Lengths
✍ G. FijavΕΎ; M. Juvan; B. Mohar; R. Ε krekovski πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 208 KB

It is easy to see that planar graphs without 3-cycles are 3-degenerate. Recently, it was proved that planar graphs without 5-cycles are also 3-degenerate. In this paper it is shown, more surprisingly, that the same holds for planar graphs without 6-cycles.