Coloring chip configurations on graphs and digraphs

DOI10.1016/J.IPL.2011.09.011MaRDI QIDQ763476zbMATH OpenOpenAlexFDO

Authors Mieczysław Borowiecki, Jarosław Grytczuk, Monika Pilśniak

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

zbMATH Keywords

graph algorithmsgraph coloringdigraph coloringcombinatorial problemschip arrangementchip shifting operation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 3245178
• scientific article; zbMATH DE number 52166
• Sur le coloriage des graphs
• On efficient coloring of chordless graphs
• On chromaticity of graphs
• Chromatic graph theory
• Chromatic graph theory
• Parameterized coloring problems on chordal graphs
• Parameterized and Exact Computation
• On circuits and subgraphs of chromatic graphs

Cites work

• scientific article; zbMATH DE number 47933 (Why is no real title available?)
• Degree constrained subgraphs
• Edge weights and vertex colours
• Lucky labelings of graphs
• On a \(1,2\) conjecture
• Weight choosability of graphs

Cited in

(15)

• Local antimagic orientations of \(d\)-degenerate graphs
• Proper orientations and proper chromatic number
• Local antimagic orientation of graphs
• An oriented version of the 1-2-3 conjecture
• On the semi-proper orientations of graphs
• On the in-out-proper orientations of graphs
• Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
• 1-2-3 Conjecture in digraphs: more results and directions
• Adding direction constraints to the 1-2-3 conjecture
• Weight choosability of oriented hypergraphs
• A note on a directed version of the 1-2-3 conjecture
• The complexity of the proper orientation number
• On generalisations of the AVD conjecture to digraphs
• On a directed variation of the 1-2-3 and 1-2 conjectures
• The neighbour-sum-distinguishing edge-colouring game

This page was built for publication: Coloring chip configurations on graphs and digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763476)