On directed graphs with an independent covering set (Q1264153)
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 directed graphs with an independent covering set |
scientific article; zbMATH DE number 4128835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On directed graphs with an independent covering set |
scientific article; zbMATH DE number 4128835 |
Statements
On directed graphs with an independent covering set (English)
0 references
1989
0 references
It is shown that if a directed graph contains no odd directed cycle and, for all but finitely many nodes, either the in-degrees are finite or the out-degrees are at most one, then the directed graph contains an independent covering set. An example is given to show that a countable directed graph having no directed cycles, each of its nodes has at most out-degree two, has no independent covering set.
0 references
digraph
0 references
directed graph
0 references
independent covering set
0 references
directed cycles
0 references
degree
0 references
0 references
0.7704992294311523
0 references
0.7657721042633057
0 references
0.7567633986473083
0 references
0.7534540295600891
0 references
0.7530061602592468
0 references
