Smallest Sets of Longest Paths with Empty Intersection

DOI10.1017/S0963548300002170zbMath0863.05048OpenAlexW2073695625MaRDI QIDQ2785375

Zdzisław Skupień

Publication date: 20 May 1997

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300002170

zbMATH Keywords

longest pathsempty intersection

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (7)

Detour trees ⋮ Intersecting longest paths ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Bounding the distance among longest paths in a connected graph ⋮ Unnamed Item ⋮ Nonempty intersection of longest paths in series-parallel graphs ⋮ WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?

Cites Work

• On longest paths and circuits in graphs.
• Unnamed Item

This page was built for publication: Smallest Sets of Longest Paths with Empty Intersection