TY - GEN
A1 - Nkoghosyan Zhora G.
PB - "GITUTYUN" PUBLISHING HOUSE OF NAS RA
N2 - Let l be the length of a longest path in a 2-connected graph G and c the circumference - the length of a longest cycle in G. In 1952, Dirac proved that c , by noting that "actually c , but the proof of this result, which is best possible, is rather complicated". Let L1;L2; :::;Lm be a vine on a longest path of G. In this paper, using the parameter m, we present a more general sharp bound for the circumference c including the bound c as an immediate corollary, based on elementary arguments.
L1 - http://noad.sci.am/Content/136242/29-Article+Text-53-1-10-20210122.pdf
L2 - http://noad.sci.am/Content/136242
T1 - Relative Lengths of Paths and Cycles in 2-Connected Graphs
UR - http://noad.sci.am/dlibra/docmetadata?id=136242
ER -