Switching Distance Between Graphs with the Same Degrees
From MaRDI portal
Recommendations
Cited in
(18)- Split graphs
- On certain trees with the same degree sequence
- On the hardness of switching to a small number of edges
- Approximating shortest connected graph transformation for trees
- scientific article; zbMATH DE number 3910445 (Why is no real title available?)
- scientific article; zbMATH DE number 3912422 (Why is no real title available?)
- A degree sequence problem related to network design
- scientific article; zbMATH DE number 1409233 (Why is no real title available?)
- The Perfect Matching Reconfiguration Problem
- Transforming Graphs with the Same Degree Sequence
- Parameterized problems related to Seidel's switching
- scientific article; zbMATH DE number 7535774 (Why is no real title available?)
- On homotopy of connected graphs having the same degree function
- On the longest flip sequence to untangle segments in the plane
- Short flip sequences to untangle segments in the plane
- Switches in Eulerian graphs
- A family of switch equivalent graphs
- An algorithmic study of switch graphs
This page was built for publication: Switching Distance Between Graphs with the Same Degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4699158)
