The longest cycle of a graph with a large minimal degree

DOI10.1002/JGT.3190100115MaRDI QIDQ3720635zbMATH OpenOpenAlexFDO

Authors Noga Alon

Publication date 1986

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190100115

zbMATH Keywords

Katchalski conjecturelong cycleminimal degree

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Cycle lengths in graphs with large minimum degree
• Longest cycles in regular graphs
• Cycles and paths in graphs with large minimal degree
• A degree condition for the circumference of a graph

Cited in

(14)

• Dirac-type generalizations concerning large cycles in graphs
• Trees through specified vertices
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• Cycle lengths and minimum degree of graphs
• The number of Hamiltonian decompositions of regular graphs
• A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
• Stability for vertex cycle covers
• scientific article; zbMATH DE number 146256 (Why is no real title available?)
• scientific article; zbMATH DE number 841612 (Why is no real title available?)
• Tight cycles and regular slices in dense hypergraphs
• Graph invariants and large cycles: a survey
• Exact methods for the longest induced cycle problem
• Degree conditions for Ramsey goodness of paths
• Cycles through specified vertices

This page was built for publication: The longest cycle of a graph with a large minimal degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3720635)