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

DOI10.1007/S00373-019-02010-9MaRDI QIDQ1741587zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Destroying longest cycles in graphs and digraphs
• On a conjecture of Grünbaum on longest cycles
• scientific article; zbMATH DE number 3979098
• On the length of longest dominating cycles in graphs
• A note on a longest cycle which is vertex dominating
• On the Intersections of Longest Cycles in a Graph
• On the length of longest chordless cycles
• On longest cycles and strongly linking vertex sets
• A new proof of a theorem on long cycles
• scientific article; zbMATH DE number 3875324

Cites work

• Destroying longest cycles in graphs and digraphs
• Every graph occurs as an induced subgraph of some hypohamiltonian graph
• scientific article; zbMATH DE number 3577225 (Why is no real title available?)
• scientific article; zbMATH DE number 1011075 (Why is no real title available?)
• Intersecting longest paths and longest cycles: a survey
• On non-Hamiltonian graphs for which every vertex-deleted subgraph is traceable

Cited in

(2)

• Destroying longest cycles in graphs and digraphs
• On the Intersections of Longest Cycles in a Graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741587)