Pages that link to "Item:Q3183470"
From MaRDI portal
The following pages link to Reconfiguration of List Edge-Colorings in a Graph (Q3183470):
Displaying 15 items.
- Finding shortest paths between graph colourings (Q309791) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Shortest paths between shortest paths (Q719258) (← links)
- Connected \(k\)-dominating graphs (Q1618230) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- The \(k\)-dominating graph (Q2014712) (← links)
- Finding Shortest Paths Between Graph Colourings (Q2946021) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
