Long Circuits and Large Euler Subgraphs

DOI10.1007/978-3-642-40450-4_42zbMath1395.68149DBLPjournals/siamdm/FominG14arXiv1304.5746OpenAlexW2003996383WikidataQ60488426 ScholiaQ60488426MaRDI QIDQ5891185

Petr A. Golovach, Fedor V. Fomin

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science, SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.5746

zbMATH Keywords

parameterized complexityEuler subgraphlong circuit

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Deterministic Truncation of Linear Matroids ⋮ Finding even subgraphs even faster ⋮ Eulerian walks in temporal graphs ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs

This page was built for publication: Long Circuits and Large Euler Subgraphs