Optimal shift coloring of trees

DOI10.1016/J.ORL.2014.04.004MaRDI QIDQ1785225zbMATH OpenOpenAlexFDO

Authors Giovanni Andreatta, Luigi De Giovanni, Paolo Serafini

Publication date 28 September 2018

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2014.04.004

zbMATH Keywords

treesgraph coloringpolynomial-time algorithmshift coloring

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Multicoloring trees.
• Graph coloring problems
• Time slot scheduling of compatible jobs
• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
• Exact algorithms for a discrete metric labeling problem

Cites work

• Optimal shift partitioning of pharmacies
• The distance matrix of a graph and its tree realization

Cited in

(2)

• Constrained domatic bipartition on trees
• Optimal shift partitioning of pharmacies

This page was built for publication: Optimal shift coloring of trees

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