A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs (Q1873579)
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 combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs |
scientific article; zbMATH DE number 1916591
| 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; zbMATH DE number 1916591 |
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
