A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs (Q1873579): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On a class of kernel-perfect and kernel-perfect-critical graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphes Noyau-Parfaits / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on kernel-critical graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On kernel-perfect critical digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q2715213 / rank | |||
Normal rank | |||
Latest revision as of 16:03, 5 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs |
scientific article |
Statements
A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs (English)
0 references
23 September 2003
0 references
ordered circular permutation
0 references
kernel-perfect critical
0 references
digraph
0 references
