Optimal shift coloring of trees

DOI10.1016/j.orl.2014.04.004zbMath1408.05056OpenAlexW1995343213MaRDI QIDQ1785225

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

graph coloringpolynomial-time algorithmtreesshift coloring

Mathematics Subject Classification ID

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

Related Items (2)

Optimal shift partitioning of pharmacies ⋮ Constrained domatic bipartition on trees

Cites Work

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

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