Cut-colorings in coloring graphs
type: Item
instance of: scholarly article
title: Cut-colorings in coloring graphs
zbMATH Open document ID: 1407.05086
author: Prateek Bhakta
author: Benjamin Brett Buckner
author: Lauren Farquhar
author: Vikram Kamat
author: Sara Krehbiel
author: Heather M. Russell
published in: Graphs and Combinatorics
publication date: 2019-03-21T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7040469
zbMATH Keywords: graph coloring
zbMATH Keywords: reconfiguration
zbMATH Keywords: cut-coloring
MaRDI profile type: Publication
full work available at URL: s00373-018-1985-6
OpenAlex ID: W2903114345
cites work: Classifying coloring graphs
cites work: Connectedness of the graph of vertex-colourings
cites work: Mixing 3-colourings in bipartite graphs
cites work: Finding paths between 3-colorings
cites work: Gray code numbers for graphs
cites work: Randomly coloring sparse random graphs with fewer colors than the maximum degree
cites work: The complexity of dominating set reconfiguration
cites work: On the complexity of reconfiguration problems
cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
cites work: Markov chain algorithms for planar lattice structures
cites work: The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
cites work: Improved bounds for sampling colorings
Wikidata QID: Q128857765
DOI: 10.1007/S00373-018-1985-6
description: scientific article; zbMATH DE number 7040469