Graph coloring and Graham's greatest common divisor problem

DOI10.1016/j.disc.2017.11.006zbMath1378.05046OpenAlexW2777094518MaRDI QIDQ1690244

Wiktor Żelazny, Jarosław Grytczuk, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Bartłomiej Bosek, Michał Dębski

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.11.006

zbMATH Keywords

coloringGraham's problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Latin squares from multiplication tables ⋮ From the 1-2-3 conjecture to the Riemann hypothesis

Cites Work

• Additive coloring of planar graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Lucky labelings of graphs
• The solution of Graham's greatest common divisor problem
• On a conjecture of Graham
• Edge weights and vertex colours
• The Difference Between Consecutive Primes, II
• On a conjecture of R. L. Graham
• Differences of Sets and A Problem of Graham
• Unnamed Item

This page was built for publication: Graph coloring and Graham's greatest common divisor problem