Ore-type degree condition for heavy paths in weighted graphs (Q2570107)

In a weighted graph each edge is assigned a non-negative weight. The weight of a vertex in a weighted graph is the sum of weights of edges incident with it, and the weight of a path is the sum of weights of edges belonging to that path. The main result of the paper says: Let \(G\) be a 2-connected weighted graph and \(x,y\) be two distinct vertices of \(G.\) If the sum of weights of any two non-adjacent vertices \(u,v\in V(G)\backslash \{x,y\}\) is at least \(2d\) then there is in \(G\) either an \(x\)-\(y\) path of weight at least \(d\) or an \(x\)-\(y\) Hamiltonian path.