On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647): Difference between revisions
From MaRDI portal
Latest revision as of 14:11, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On \(k\)-strong and \(k\)-cyclic digraphs |
scientific article |
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
