A degree condition for the circumference of a graph

DOI10.1002/JGT.3190130308zbMATH Open0679.05044OpenAlexW2129969858MaRDI QIDQ3835488FDOQ3835488

Authors: Nathaniel Dean, Pierre Fraisse 

Publication date: 1989

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

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

Recommendations

• A degree condition for the circumference of a graph
• scientific article; zbMATH DE number 147625
• scientific article; zbMATH DE number 26309
• Relative length of long paths and cycles in graphs with large degree sums
• Circumference of a graph and its distance dominating longest cycles

zbMATH Keywords

long cycledegree sumscircumference of a graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (15)

• Degree bounds for the circumference of 3‐connected graphs
• Degree sum conditions for the circumference of 4-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Degree sums for edges and cycle lengths in graphs
• A degree condition for cycles passing through specified vertices and edges
• Title not available (Why is that?)
• Title not available (Why is that?)
• A degree condition for the circumference of a graph
• A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
• The longest cycle of a graph with a large minimal degree
• Title not available (Why is that?)
• A degree sum condition for long cycles passing through a linear forest
• Advanced lower bounds for the circumference
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)

This page was built for publication: A degree condition for the circumference of a graph

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