Block symmetries in graph coloring reconfiguration systems
From MaRDI portal
Publication:6107838
DOI10.1016/j.aam.2023.102556zbMath1518.05056OpenAlexW4377819032MaRDI QIDQ6107838
Aalok Sathe, Maxine Xin, Sara Krehbiel, Rachel Morris, Prateek Bhakta, Heather M. Russell, Wesley Su
Publication date: 3 July 2023
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2023.102556
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classifying coloring graphs
- Geometry of the space of phylogenetic trees
- Groups of automorphisms and almost automorphisms of trees: subgroups and dynamics
- Cut-colorings in coloring graphs
- Introduction to reconfiguration
- The geometry and topology of reconfiguration
- Connectedness of the graph of vertex-colourings
- Improved bounds for sampling colorings
- The canonical coloring graph of trees and cycles
- Gray code numbers for graphs
- Moving Robots Efficiently Using the Combinatorics of CAT(0) Cubical Complexes
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- Finding Topology in a Factory: Configuration Spaces
- The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
- Improved bounds for perfect sampling of k-colorings in graphs
- Improved Bounds for Randomly Sampling Colorings via Linear Programming
- Perfectly sampling k ≥ (8/3 + o (1))Δ-colorings in graphs
This page was built for publication: Block symmetries in graph coloring reconfiguration systems