Paper Info
Title
On a Question of van Aardt et al. on Destroying All Longest Cycles
Abstract
We describe an infinite family of 2-connected graphs, each of which has the property that the intersection of all longest cycles is empty. In particular, we present such graphs with circumference 10, 13, and 16. This settles a question of van Aardt et al. (Discrete Appl Math 186:251–259, 2015) concerning the existence of such graphs for all but one case, namely circumference 11. We also present a 2-connected graph of circumference 11 in which all but one vertex are avoided by some longest cycle.
Year
DOI
Venue
2019
10.1007/s00373-019-02010-9
Graphs and Combinatorics
Keywords
Field
DocType
Longest cycle, Circumference, Vertex deletion, 05C38
Longest cycle,Graph,Circumference,Combinatorics,Vertex (geometry),Mathematics
Journal
Volume
Issue
ISSN
35
2
1435-5914
Citations 
PageRank 
References 
0
0.34
3
Authors
1
Name
Order
Citations
PageRank
Carol T. Zamfirescu13815.25