Improvements on Hippchen's conjecture

DOI10.1016/j.disc.2022.113029zbMath1495.05148arXiv2011.09061OpenAlexW3101380790WikidataQ113877016 ScholiaQ113877016MaRDI QIDQ2166288

Ilkyoo Choi, Eun-Kyung Cho, Boram Park

Publication date: 24 August 2022

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

Full work available at URL: https://arxiv.org/abs/2011.09061

zbMATH Keywords

longest path\(k\)-connected graphHippchen's conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Cites Work

• Nonempty intersection of longest paths in series-parallel graphs
• Intersections of longest cycles in \(k\)-connected graphs
• On longest paths and circuits in graphs.
• Intersecting longest paths and longest cycles: A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvements on Hippchen's conjecture