Object
Title: Relative Lengths of Paths and Cycles in 2-Connected Graphs
Abstract:
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.
Publisher:
"GITUTYUN" PUBLISHING HOUSE OF NAS RA
Date of publication:
Identifier:
oai:noad.sci.am:136242
DOI:
ISSN:
Language:
Journal or Publication Title:
Mathematical Problems of Computer Science
Volume:
URL:
Affiliation:
Institute for Informatics and Automation Problems of NAS RA
Country:
Year:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Publications
Last modified:
May 6, 2021
In our library since:
May 6, 2021
Number of object content hits:
8
All available object's versions:
https://noad.sci.am/publication/149807
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Nkoghosyan Zhora G., Relative Lengths of Paths and Cycles in 2-Connected Graphs | May 6, 2021 |
