Length of longest cycles in a graph whose relative length is at least two
type: Item
instance of: scholarly article
title: Length of longest cycles in a graph whose relative length is at least two
zbMATH Open document ID: 1256.05126
author: Kenta Ozeki
author: Tomoki Yamashita
published in: Graphs and Combinatorics
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6121359
zbMATH Keywords: circumference
zbMATH Keywords: relative length
zbMATH Keywords: degree sum
MaRDI profile type: Publication
full work available at URL: s00373-011-1078-2
OpenAlex ID: W2071976572
cites work: Long cycles in graphs with prescribed toughness and minimum degree
cites work: Q4094891
cites work: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
cites work: Relative lengths of paths and cycles in 3-connected graphs
cites work: Some Theorems on Abstract Graphs
cites work: The longest cycles in a graph G with minimum degree at least \(| G| /k\)
cites work: Q4500709
cites work: Relative length of long paths and cycles in graphs with large degree sums
cites work: Extremal problems involving neighborhood unions
cites work: On a conjecture of Bondy
cites work: Longest cycles in tough graphs
cites work: Relative length of longest paths and cycles in 3-connected graphs
cites work: A lower bound for the circumference of a graph
cites work: Lower bounds of length of longest cycles in graphs involving neighborhood unions
cites work: On a graph theorem by dirac
cites work: On relative length of longest paths and cycles
cites work: Long paths, long cycles, and their relative length
cites work: Q3997887
cites work: Circumference and girth
DOI: 10.1007/S00373-011-1078-2
description: scientific article; zbMATH DE number 6121359