Parameterized Complexity of Connected Even/Odd Subgraph Problems
From MaRDI portal
Publication:2904782
DOI10.4230/LIPICS.STACS.2012.432zbMath1245.68106OpenAlexW2266466481MaRDI QIDQ2904782
Fedor V. Fomin, Petr A. Golovach
Publication date: 23 August 2012
Full work available at URL: https://doi.org/10.4230/LIPIcs.STACS.2012.432
Analysis of algorithms and problem complexity (68Q25) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)
Related Items (1)
This page was built for publication: Parameterized Complexity of Connected Even/Odd Subgraph Problems
