Editing to Connected f-Degree Graph

DOI10.4230/LIPIcs.STACS.2016.36zbMath1388.68229OpenAlexW2293427588MaRDI QIDQ4601888

Fedor V. Fomin, Petr A. Golovach, Saket Saurabh, Fahad Panolan

Publication date: 24 January 2018

Full work available at URL: http://dblp.uni-trier.de/db/conf/stacs/stacs2016.html#FominGPS16

zbMATH Keywords

FPTrepresentative familycolor codingconnected \(f\)-factor

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Finding even subgraphs even faster ⋮ Editing to a connected graph of given degrees ⋮ Unnamed Item ⋮ Linear representation of transversal matroids and gammoids parameterized by rank

This page was built for publication: Editing to Connected f-Degree Graph