Long Circuits and Large Euler Subgraphs
DOI10.1007/978-3-642-40450-4_42zbMath1395.68149arXiv1304.5746WikidataQ60488426 ScholiaQ60488426MaRDI QIDQ5891185
Fedor V. Fomin, Petr A. Golovach
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
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C45: Eulerian and Hamiltonian graphs
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
