Decomposition of directed graphs and the Turán problem
We 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.
Saved in:
| Date: | 2014 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут математики НАН України
2014
|
| Series: | Український математичний журнал |
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Decomposition of directed graphs and the Turán problem / B.V. Novikov, L.Yu. Polyakova, G.N. Zholtkevich // Український математичний журнал. — 2014. — Т. 66, № 7. — С. 958–969. — Бібліогр.: 6 назв. — англ. |