TY - GEN
A1 - Koulakzian Mossine
A2 - Nikoghosyan Zhora
N2 - Two lower bounds for the circumference (the length of a longest cycle C in a graph G) are presented in terms of a longest path (a longest cycle) in G-C and the average of the first i smallest degrees in G. As immediate corollaries, we obtain the original lower bounds for the circumference in terms of G-C structures and the minimum degree of G (Zh.G. Nikoghosyan, “Advanced Lower Bounds for the Circumference”, Graphs and Combinatorics 29, pp. 1531- 1541, 2013).
L1 - http://noad.sci.am/Content/135778/DMCA10.pdf
L2 - http://noad.sci.am/Content/135778
T1 - Two Generalized Lower Bounds for the Circumference
UR - http://noad.sci.am/dlibra/docmetadata?id=135778
ER -