Graph editing to a given neighbourhood degree list is fixed-parameter tractable

DOI10.1007/978-3-319-71147-8_10zbMATH Open1474.05373OpenAlexW2551643417MaRDI QIDQ1708604FDOQ1708604

Authors: N. Nishimura, Vijay Subramanya 

Publication date: 26 March 2018

Full work available at URL: http://hdl.handle.net/10012/11026

Recommendations

• Editing graphs to satisfy degree constraints: a parameterized approach
• Editing to Connected F-Degree Graph
• Editing to connected \(f\)-degree graph
• Parameterized Graph Editing with Chosen Vertex Degrees
• The parameterized complexity of editing graphs for bounded degeneracy
• Editing to a connected graph of given degrees
• Editing to a connected graph of given degrees
• Graph editing problems with extended regularity constraints
• On the editing distance of graphs
• Editing to a planar graph of given degrees

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (2)

• Neighborhood degree lists of graphs
• Introduction to reconfiguration

This page was built for publication: Graph editing to a given neighbourhood degree list is fixed-parameter tractable

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