On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On \(k\)-strong and \(k\)-cyclic digraphs |
scientific article; zbMATH DE number 1019016
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \(k\)-strong and \(k\)-cyclic digraphs |
scientific article; zbMATH DE number 1019016 |
Statements
On \(k\)-strong and \(k\)-cyclic digraphs (English)
0 references
10 June 1997
0 references
A digraph \(D\) is \(k\)-cyclic if for every set \(X\) of \(k\) vertices of \(D\) there exists a cycle of \(D\) containing all the vertices of \(X\). The authors prove that for every natural number \(k\) every \(k\)-strong digraph from a specified family of digraphs is \(k\)-cyclic.
0 references
digraphs
0 references
0 references
0 references
0 references
0.9164828
0 references
0.9090276
0 references
0 references
0.9083474
0 references
0.90704364
0 references
