Object
Title: Long Cycles in t-Tough Graphs with t > 1 ; Длинные циклы в t-жестких графах при t > і
Abstract:
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 graph.
;
Доказывается, что любой n-вершинный t-жесткий граф с минимальной степенью δ при t > 1 имеет цикл длины не меньше min {n,2δ+4}.
Date submitted:
Date accepted:
Identifier:
oai:noad.sci.am:136048
DOI:
ISSN:
Other identifier:
Language:
Journal or Publication Title:
Mathematical Problems of Computer Science
Volume:
URL:
Additional Information:
Affiliation:
Institute for Informatics and Automation Problems ; Институт проблем информатики и автоматизации
Country:
Indexing:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Publications
Last modified:
Apr 1, 2021
In our library since:
Jul 30, 2020
Number of object content hits:
18
All available object's versions:
https://noad.sci.am/publication/149687
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Zhora Nikoghosyan, Long Cycles in t-Tough Graphs with t > 1 | Apr 1, 2021 |
