Coloring chip configurations on graphs and digraphs
From MaRDI portal
Publication:763476
DOI10.1016/j.ipl.2011.09.011zbMath1232.05074MaRDI QIDQ763476
Mieczysław Borowiecki, Monika Pilśniak, Jarosław Grytczuk
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/211363
graph coloring; combinatorial problems; graph algorithms; digraph coloring; chip arrangement; chip shifting operation
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
Related Items
Weight choosability of oriented hypergraphs, Proper orientations and proper chromatic number, On a directed variation of the 1-2-3 and 1-2 conjectures, The neighbour-sum-distinguishing edge-colouring game, 1-2-3 Conjecture in digraphs: more results and directions, A note on a directed version of the 1-2-3 conjecture, Local antimagic orientations of \(d\)-degenerate graphs, On the in-out-proper orientations of graphs, Local antimagic orientation of graphs, An oriented version of the 1-2-3 conjecture, The complexity of the proper orientation number, On generalisations of the AVD conjecture to digraphs, On the semi-proper orientations of graphs
Cites Work
