scientific article; zbMATH DE number 7525461
From MaRDI portal
Publication:5075761
DOI10.4230/LIPIcs.ESA.2019.24MaRDI QIDQ5075761
Valentin Bartier, Nicolas Bousquet
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1907.01863
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Recoloring Planar Graphs of Girth at Least Five ⋮ An update on reconfiguring 10-colorings of planar graphs ⋮ Recoloring graphs of treewidth 2
Cites Work
- Unnamed Item
- Unnamed Item
- Fast recoloring of sparse graphs
- Mixing 3-colourings in bipartite graphs
- Recoloring graphs via tree decompositions
- Token sliding on chordal graphs
- Flipping edge-labelled triangulations
- Paths between colourings of graphs with bounded tree-width
- Reconfiguration of graphs with connectivity constraints
- Shortest reconfiguration of matchings
- Reconfiguration of maximum weight \(b\)-matchings in a graph
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- A Reconfigurations Analogue of Brooks' Theorem and Its Consequences
- Finding paths between 3-colorings
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
- Improved Bounds for Randomly Sampling Colorings via Linear Programming
This page was built for publication:
