Circumference of Graphs with Bounded Degree
From MaRDI portal
Publication:4651509
DOI10.1137/S0097539703436473zbMath1055.05089OpenAlexW2045703776MaRDI QIDQ4651509
Xingxing Yu, Guantao Chen, Jun Xu
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539703436473
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Cubic Graphs with Large Circumference Deficit ⋮ Multiplicity of the second‐largest eigenvalue of a planar graph ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Finding large cycles in Hamiltonian graphs ⋮ Approximating the longest paths in grid graphs