Editing to a Connected Graph of Given Degrees

DOI10.1007/978-3-662-44465-8_28zbMath1426.68122arXiv1308.1802OpenAlexW1869660301MaRDI QIDQ2922619

Petr A. Golovach

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1308.1802

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Vertex degrees (05C07)

Related Items (9)

Win-win kernelization for degree sequence completion problems ⋮ Editing to a Planar Graph of Given Degrees ⋮ Fixed-parameter tractable distances to sparse graph classes ⋮ Editing to Eulerian graphs ⋮ Graph editing to a given degree sequence ⋮ Graph editing problems with extended regularity constraints ⋮ Graph Editing to a Given Degree Sequence ⋮ Editing to a planar graph of given degrees ⋮ Editing to a graph of given degrees

This page was built for publication: Editing to a Connected Graph of Given Degrees