





















A theorem of Hakimi, Mitchem and Schmeichel from 1996 states that the edge arboricity arb(G) of a graph is bounded above by the acyclic chromatic number acy(G). We can improve this HMS inequality by 1, if acy(G) is even. We review also results about acyclic chromatic numbers in the context of a Grünbaum conjecture from 1973.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。