Open AccessLong Cycles in t-Tough Graphs with t > 1
Mathematical Problems Of Computer SciencePeer ReviewedZh. G. Nikoghosyan2019Journals
It is proved that if G is a t-tough graph of order n and minimum degree δ with t > 1, then either G has a cycle of length at least min{n, 2δ + 4} or G is the Petersen graphIt is proved that if G is a t-tough graph of order n and minimum degree δ with t > 1, then either G has a cycle of length at least min{n, 2δ + 4} or G is the Petersen graph
The content you want is available to Zendy users.
Already have an account? Sign inHaving issues? Contact support