On a question of van Aardt et al. on destroying all longest cycles

DOI10.1007/s00373-019-02010-9zbMath1409.05119OpenAlexW2912170819MaRDI QIDQ1741587

Carol T. Zamfirescu

Publication date: 3 May 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02010-9

zbMATH Keywords

circumferencelongest cyclevertex deletion

Mathematics Subject Classification ID

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

Cites Work

• Destroying longest cycles in graphs and digraphs
• Every graph occurs as an induced subgraph of some hypohamiltonian graph
• Intersecting longest paths and longest cycles: A survey
• On Non‐Hamiltonian Graphs for which every Vertex‐Deleted Subgraph Is Traceable
• Unnamed Item
• Unnamed Item

This page was built for publication: On a question of van Aardt et al. on destroying all longest cycles