## Abstract

Edge degree conditions have been studied since the 1980s, mostly with regard to hamiltonicity of line graphs and the equivalent existence of dominating closed trails in their root graphs, as well as the stronger property of being supereulerian, i.e., admitting a spanning closed trail. For a graph G, let σ¯2(G)=min{ d(u)+d(v)|uv ∈ E(G)}. Chen et al. conjectured that a 3-edge-connected graph G with sufficientl large order n and σ¯2(G)>n9-2 is either supereulerian or contractible to the Petersen graph. We show that the conjecture is true when σ¯2(G)≥2. Furthermore, we show that for an essentially k-edge-connected graph G with sufficiently large order n, the following statements hold. (i) If k = 2 and σ¯2(G)≥, then either L(G) is hamiltonian or G can be contracted to one of a set of six graphs which are not supereulerian; (ii) If k = 3 and σ¯2(G)≥2), then either L(G) is hamiltonian or G can be contracted to the Petersen graph.

Original language | English |
---|---|

Pages (from-to) | 363-381 |

Number of pages | 19 |

Journal | Discussiones Mathematicae - Graph Theory |

Volume | 44 |

Issue number | 1 |

Early online date | 26 Feb 2022 |

DOIs | |

Publication status | Published - Jan 2024 |

## Keywords

- Degree sum
- Hamiltonicity
- Line graph
- Supereulerian