Coloring chip configurations on graphs and digraphs
type: Item
instance of: scholarly article
title: Coloring chip configurations on graphs and digraphs
zbMATH Open document ID: 1232.05074
author: Mieczysław Borowiecki
author: Jarosław Grytczuk
author: Monika Pilśniak
published in: Information Processing Letters
publication date: 2012-03-09T00:00:00Z
full work available at URL: https://eudml.org/doc/211363
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6013675
zbMATH Keywords: combinatorial problems
zbMATH Keywords: graph algorithms
zbMATH Keywords: graph coloring
zbMATH Keywords: chip arrangement
zbMATH Keywords: chip shifting operation
zbMATH Keywords: digraph coloring
MaRDI profile type: Publication
OpenAlex ID: W2001557718
cites work: Degree constrained subgraphs
cites work: Weight choosability of graphs
cites work: Lucky labelings of graphs
cites work: Q3999001
cites work: Edge weights and vertex colours
cites work: Q3575472
DOI: 10.1016/J.IPL.2011.09.011
Recommended article: Q5532260
Recommended article: Q4002519
Recommended article: Sur le coloriage des graphs
Recommended article: On Efficient Coloring of Chordless Graphs
Recommended article: On chromaticity of graphs
Recommended article: Q3525736
Recommended article: Chromatic Graph Theory
Recommended article: Parameterized coloring problems on chordal graphs
Recommended article: Parameterized and Exact Computation
Recommended article: On circuits and subgraphs of chromatic graphs
description: scientific article; zbMATH DE number 6013675