2025-02-23T04:46:45-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-166054%22&qt=morelikethis&rows=5
2025-02-23T04:46:45-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-166054%22&qt=morelikethis&rows=5
2025-02-23T04:46:45-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T04:46:45-05:00 DEBUG: Deserialized SOLR response
Decomposition of directed graphs and the Turán problem

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:
Bibliographic Details
Main Authors: Novikov, B.V., Polyakova, L.Yu., Zholtkevich, G.N.
Format: Article
Language:English
Published: Інститут математики НАН України 2014
Series:Український математичний журнал
Subjects:
Статті
Online Access:http://dspace.nbuv.gov.ua/handle/123456789/166054
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.

Similar Items