Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree

DOI10.4153/CJM-1980-102-7zbMath0409.05037MaRDI QIDQ4196453

Roger Entringer, J. A. Bondy

Publication date: 1980

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

zbMATH Keywords

2-Connected GraphsLongest CyclesPrescribed Maximum Degree

Mathematics Subject Classification ID

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

Related Items (14)

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

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