Abstract.
Let G and H be two graphs. We say that G is homomorphic with H if there is a mapping g from V(G) to V(H) such that g(v)g(u)∈E(H) if vu∈E(G). The odd girth of a graph is the shortest length of odd cycles of the graph.
In this paper, we shall show that every graph G of order n with the odd girth at least 7 and minimum degree greater than n/4 is homomorphic with C 7.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: December 25, 1995 / Revised: June 9, 1997
Rights and permissions
About this article
Cite this article
Häggkvist, R., Jin, G. Graphs with Odd Girth at Least Seven and High Minimum Degree. Graphs Comb 14, 351–362 (1998). https://doi.org/10.1007/PL00021183
Issue Date:
DOI: https://doi.org/10.1007/PL00021183