Bipartizing with a matching

DOI10.1007/978-3-030-04651-4_14zbMath1494.68201OpenAlexW2900864999MaRDI QIDQ2327112

Uéverton S. Souza, Dieter Rautenbach, Jayme Luiz Szwarcfiter, Carlos Vinícius G. C. Lima

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_14

zbMATH Keywords

planar graphsgraph modification problemsdefective coloringedge bipartization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Bipartizing with a matching