Decomposition of Directed Graphs and the Turán Problem
AbstractWe consider vertex decompositions of (di)graphs appearing in the automata theory and establish some properties of these decompositions. These decompositions are applied to the problem of forbidden subgraphs.
How to Cite
ZholtkevichG. N., NovikovB. V., and PolyakovaL. Y. “Decomposition of Directed Graphs and the Turán Problem”. Ukrains’kyi Matematychnyi Zhurnal, Vol. 66, no. 7, July 2014, pp. 958–969, http://umj.imath.kiev.ua/index.php/umj/article/view/2191.