A decomposition of directed graphs and the Turan problem
We consider vertex decompositions of (di)graphs which appear in Automata Theory, and establish some their properties. Then we apply them to the problem of forbidden subgraphs.
math.CO↗
arXiv subjects
Publications and source records attributed to G. N. Zholtkevich.
We consider vertex decompositions of (di)graphs which appear in Automata Theory, and establish some their properties. Then we apply them to the problem of forbidden subgraphs.