Longest cycle above Erdős-Gallai bound

DOI10.1137/23M1558008MaRDI QIDQ6633134

Could not fetch data.

Publication date: 5 November 2024

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

longest cycleaverage degreelongest pathfixed-parameter tractabilitydense graphErdős and Gallai theoremabove guarantee parameterization

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Long cycles and the codiameter of a graph. I
• A generalization of Dirac's theorem
• Which problems have strongly exponential complexity?
• Long directed \((s,t)\)-path: FPT algorithm
• Hamiltonicity below Dirac's condition
• On maximal paths and circuits of graphs
• Color-coding
• A Fast Parametric Maximum Flow Algorithm and Applications
• Going Far from Degeneracy
• Parameterized Algorithms
• Some Theorems on Abstract Graphs
• Parameterization Above a Multiplicative Guarantee
• Algorithmic extensions of Dirac's theorem

This page was built for publication: Longest cycle above Erdős-Gallai bound

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