Editing to Eulerian graphs

DOI10.4230/LIPICS.FSTTCS.2014.97MaRDI QIDQ2978505zbMATH OpenFDO

Authors Konrad Dabrowski, Petr A. Golovach, Pim Van 't Hof, Daniël Paulusma

Publication date 25 April 2017

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2014.97

zbMATH Keywords

Eulerian graphsgraph editingpolynomial algorithm

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Editing to Eulerian graphs
• Parameterized complexity of Eulerian deletion problems
• Editing to a connected graph of given degrees
• Finding even subgraphs even faster
• Editing to a connected graph of given degrees

Cited in

(9)

• Finding even subgraphs even faster
• Parameterized complexity of Eulerian deletion problems
• Deviation estimates for Eulerian edit numbers of random graphs
• Editing to a planar graph of given degrees
• Graph editing to a fixed target
• Graph editing to a given degree sequence
• Editing to Connected F-Degree Graph
• Graph editing to a given degree sequence
• Editing to Eulerian graphs

This page was built for publication: Editing to Eulerian graphs

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