Skip to main content
Log in

Graphs with Odd Girth at Least Seven and High Minimum Degree

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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 vuE(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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: December 25, 1995 / Revised: June 9, 1997

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00021183

Keywords

Navigation