We study an extension to directed graphs of the parameter called the $b$-chromatic number of a graph in terms of acyclic vertex colorings: the dib-chromatic number. We give general bounds for this parameter. We also show some results about tournaments and regular digraphs.
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。