A parity digraph has a kernel (Q1080430): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Graphes Noyau-Parfaits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A counterexample to a conjecture of Meyniel on kernel-perfect graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5844986 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Solutions of irreflexive relations / rank | |||
Normal rank | |||
Revision as of 15:29, 17 June 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
