A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Cyclable sets of vertices in 3-connected graphs
2016
Journal of Combinatorics
Preserved Fulltext
Beginning with a result of Dirac in 1952, many results on sufficient conditions that relate degree sum and neighborhood conditions for hamiltonicity and cyclability, have been obtained. We give a new sufficient condition on degree sums and neighborhoods of any four independent vertices in a graph. We also study the extremal cases of this condition.
doi:10.4310/joc.2016.v7.n2.a14
fatcat:f7kgwhs6bzcproijxzthuihdfu