Coloring chip configurations on graphs and digraphs
From MaRDI portal
Publication:763476
DOI10.1016/J.IPL.2011.09.011zbMath1232.05074OpenAlexW2001557718MaRDI 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 coloringcombinatorial problemsgraph algorithmsdigraph coloringchip arrangementchip shifting operation
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (13)
On generalisations of the AVD conjecture to digraphs ⋮ Local antimagic orientation of graphs ⋮ On the semi-proper orientations of graphs ⋮ Proper orientations and proper chromatic number ⋮ A note on a directed version of the 1-2-3 conjecture ⋮ The complexity of the proper orientation number ⋮ Local antimagic orientations of \(d\)-degenerate graphs ⋮ On a directed variation of the 1-2-3 and 1-2 conjectures ⋮ The neighbour-sum-distinguishing edge-colouring game ⋮ An oriented version of the 1-2-3 conjecture ⋮ On the in-out-proper orientations of graphs ⋮ Weight choosability of oriented hypergraphs ⋮ 1-2-3 Conjecture in digraphs: more results and directions
Cites Work
This page was built for publication: Coloring chip configurations on graphs and digraphs
