Linda E. McGuire

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Dirac showed that a 2–connected graph of order n with minimum degree δ has circumference at least min{2δ, n}. We prove that a 2– connected, triangle-free graph G of order n with minimum degree δ either has circumference at least min{4δ−4, n}, or every longest cycle in G is dominating. This result is best possible in the sense that there exist bipartite(More)
  • 1