A parity digraph has a kernel (Q1080430): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:44, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parity digraph has a kernel |
scientific article |
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
