Long circuits and large Euler subgraphs

DOI10.1137/130936816MaRDI QIDQ6829885zbMATH OpenFDO

Authors Fedor V. Fomin, Petr A. Golovach

Publication date 26 September 2014

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

Full work available at URL https://doi.org/10.1137/130936816

zbMATH Keywords

Euler subgraphlong circuitparameterized complexity

Mathematics Subject Classification ID

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

Cited in

(1)

• Methods for finding paths of a prescribed length in weighted graphs

This page was built for publication: Long circuits and large Euler subgraphs

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