Distance recoloring
From MaRDI portal
Cites work
- A survey on the distance-colouring of graphs
- Algorithms for Square Roots of Graphs
- Distance Coloring
- Finding paths between 3-colorings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Finding shortest paths between graph colourings
- Graph theory
- Hardness Results and Efficient Algorithms for Graph Powers
- scientific article; zbMATH DE number 7272506 (Why is no real title available?)
- scientific article; zbMATH DE number 3265667 (Why is no real title available?)
- scientific article; zbMATH DE number 3308991 (Why is no real title available?)
- Introduction to reconfiguration
- Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem
- Parameterized complexity of graph constraint logic
- The complexity of change
- Using contracted solution graphs for solving reconfiguration problems
This page was built for publication: Distance recoloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442687)