Relative Length of Longest Paths and Cycles in 2-Connected Graphs

DOI10.1137/080720413zbMath1207.05096OpenAlexW2046324880MaRDI QIDQ3583298

Naidan Ji, Geng-Hua Fan

Publication date: 27 August 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080720413

zbMATH Keywords

extremal graphspaths and cyclesrelative lengths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The longest cycle problem is polynomial on interval graphs

This page was built for publication: Relative Length of Longest Paths and Cycles in 2-Connected Graphs