Cut-colorings in coloring graphs
From MaRDI portal
Publication:1733874
DOI10.1007/S00373-018-1985-6zbMath1407.05086OpenAlexW2903114345WikidataQ128857765 ScholiaQ128857765MaRDI QIDQ1733874
Benjamin Brett Buckner, Lauren Farquhar, Heather M. Russell, Sara Krehbiel, Prateek Bhakta, Vikram Kamat
Publication date: 21 March 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-018-1985-6
Related Items (2)
Cites Work
- Classifying coloring graphs
- The complexity of dominating set reconfiguration
- On the complexity of reconfiguration problems
- Mixing 3-colourings in bipartite graphs
- Connectedness of the graph of vertex-colourings
- Improved bounds for sampling colorings
- Markov Chain Algorithms for Planar Lattice Structures
- Finding paths between 3-colorings
- Gray code numbers for graphs
- Randomly coloring sparse random graphs with fewer colors than the maximum degree
- The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
This page was built for publication: Cut-colorings in coloring graphs