Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
From MaRDI portal
Publication:4196453
DOI10.4153/CJM-1980-102-7zbMath0409.05037MaRDI QIDQ4196453
Publication date: 1980
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
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, 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, 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, On relative length of longest paths and cycles