A parity digraph has a kernel (Q1080430)
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: A parity digraph has a kernel |
scientific article; zbMATH DE number 3966105
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parity digraph has a kernel |
scientific article; zbMATH DE number 3966105 |
Statements
A parity digraph has a kernel (English)
0 references
1986
0 references
A digraph is a parity digraph if for all distinct nodes x and y, the lengths of all minimal paths between x and y have the same parity. The author shows that every parity digraph has a kernel.
0 references
directed graphs
0 references
parity digraph
0 references
kernel
0 references
