Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree

DOI10.4153/CJM-1980-102-7MaRDI QIDQ4196453zbMATH OpenFDO

Authors J. A. Bondy, R. C. Entringer

Publication date 1980

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1980-102-7

zbMATH Keywords

2-Connected GraphsLongest CyclesPrescribed Maximum Degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cited in

(14)

• Hamiltonian cycles and dominating cycles passing through a linear forest
• A degree sum condition with connectivity for relative length of longest paths and cycles
• Longest cycles in 3-connected cubic graphs
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Independent sets, cliques and hamiltonian graphs
• Length of longest cycles in a graph whose relative length is at least two
• Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
• Relative length of longest paths and cycles in graphs
• Degree sum and connectivity conditions for dominating cycles
• Cubic graphs with large circumference deficit
• On relative length of longest paths and cycles
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• A simple proof of a theorem of Jung
• On degree sum conditions for long cycles and cycles through specified vertices

This page was built for publication: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree

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