Pages that link to "Item:Q2922619"
From MaRDI portal
The following pages link to Editing to a Connected Graph of Given Degrees (Q2922619):
Displaying 9 items.
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Graph editing problems with extended regularity constraints (Q526874) (← links)
- Editing to a planar graph of given degrees (Q730508) (← links)
- Editing to Eulerian graphs (Q896016) (← links)
- Editing to a graph of given degrees (Q2354405) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Editing to a Planar Graph of Given Degrees (Q3194713) (← links)
- Graph Editing to a Given Degree Sequence (Q5740185) (← links)