| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652320 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
We show that every graph with minimum degree δ>4n/17 and no odd cycles of length 3 or 5 is homomorphic with the Möbius ladder with 6 rungs and include the extremal graph characterization in the case of equality. The key tools used in our observations are simple characteristics of maximal odd girth 7 graphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
