Reconfiguration of list edge-colorings in a graph
From MaRDI portal
Publication:713316
Recommendations
- Reconfiguration of List Edge-Colorings in a Graph
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
- The complexity of (list) edge-coloring reconfiguration problem
- The list coloring reconfiguration problem for bounded pathwidth graphs
- List-recoloring of sparse graphs
Cites work
- 25 pretty graph colouring problems
- Finding paths between 3-colourings
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Games, puzzles, and computation
- List edge and list total colourings of multigraphs
- On the complexity of reconfiguration problems
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration of List Edge-Colorings in a Graph
- Reconfigurations in Graphs and Grids
- Relationships between nondeterministic and deterministic tape complexities
- Shortest Paths between Shortest Paths and Independent Sets
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Cited in
(34)- Reconfiguration of List Edge-Colorings in a Graph
- Reconfiguring vertex colourings of 2-trees
- On the parameterized complexity of reconfiguration of connected dominating sets
- On girth and the parameterized complexity of token sliding and token jumping
- Using contracted solution graphs for solving reconfiguration problems
- Rerouting shortest paths in planar graphs
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Reconfiguration on nowhere dense graph classes
- A reconfigurations analogue of Brooks' theorem and its consequences
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs
- Token sliding on graphs of girth five
- Irredundance graphs
- Kempe equivalent list edge-colorings of planar graphs
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- Introduction to reconfiguration
- Shortest reconfiguration paths in the solution space of Boolean formulas
- The list coloring reconfiguration problem for bounded pathwidth graphs
- Token sliding on graphs of girth five
- The complexity of (list) edge-coloring reconfiguration problem
- List-recoloring of sparse graphs
- Parameterized complexity of reconfiguration of atoms
- Reconfiguration graphs of shortest paths
- On reconfiguration graphs: an abstraction
- Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles
- scientific article; zbMATH DE number 7765402 (Why is no real title available?)
- Approximability of the subset sum reconfiguration problem
- Parameterized complexity of reconfiguration of atoms
- Linear-time algorithm for sliding tokens on trees
- Reconfiguration of list \(L(2,1)\)-labelings in a graph
- Reconfiguration of list \(L(2,1)\)-labelings in a graph
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
- scientific article; zbMATH DE number 7764115 (Why is no real title available?)
- Hamiltonian cycle reconfiguration with answer set programming
- Recongo: bounded combinatorial reconfiguration with answer set programming
This page was built for publication: Reconfiguration of list edge-colorings in a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713316)
