A lower bound for the circumference of a graph
From MaRDI portal
Publication:1232423
DOI10.1016/0012-365X(76)90031-5zbMath0344.05139MaRDI QIDQ1232423
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Dense on-line arbitrarily partitionable graphs ⋮ Some results on spanning trees ⋮ A note on dominating cycles in 2-connected graphs ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Length of longest cycles in a graph whose relative length is at least two ⋮ Dense arbitrarily vertex decomposable graphs ⋮ Degree sum conditions for the circumference of 4-connected graphs ⋮ An existence criterion for a cycle such that the vertices not included in it are independent ⋮ Long cycles in unbalanced bipartite graphs ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Long cycles containing \(k\)-ordered vertices in graphs ⋮ Toughness in graphs -- a survey ⋮ On degree sum conditions for long cycles and cycles through specified vertices ⋮ Bridges of longest cycles ⋮ An implicit degree condition for long cycles in 2-connected graphs
Cites Work
