Abstract.
Let p(G) and c(G) denote the number of vertices in a longest path and a longest cycle, respectively, of a finite, simple graph G. Define σ4(G)=min{d(x 1)+d(x 2)+ d(x 3)+d(x 4) | {x 1,…,x 4} is independent in G}. In this paper, the difference p(G)−c(G) is considered for 2-connected graphs G with σ4(G)≥|V(G)|+3. Among others, we show that p(G)−c(G)≤2 or every longest path in G is a dominating path.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: August 28, 2000 Final version received: May 23, 2002
Rights and permissions
About this article
Cite this article
Schiermeyer, I., Tewes, M. Longest Paths and Longest Cycles in Graphs with Large Degree Sums. Graphs Comb 18, 633–643 (2002). https://doi.org/10.1007/s003730200047
Issue Date:
DOI: https://doi.org/10.1007/s003730200047