Acyclic coloring of graphs of maximum degree five: nine colors are enough

From MaRDI portal
Revision as of 18:37, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2380043

DOI10.1016/j.ipl.2007.08.022zbMath1183.05027OpenAlexW2052022404WikidataQ56390803 ScholiaQ56390803MaRDI QIDQ2380043

Guillaume Fertin, Andre Raspaud

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.022




Related Items (18)



Cites Work


This page was built for publication: Acyclic coloring of graphs of maximum degree five: nine colors are enough