A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs

DOI10.1007/s10255-003-0079-1zbMath1029.05065OpenAlexW2076567919MaRDI QIDQ1873579

Yi Huang, Xiaofeng Guo

Publication date: 23 September 2003

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-003-0079-1

zbMATH Keywords

digraphkernel-perfect criticalordered circular permutation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

A sufficient condition for kernel perfectness of a digraph in terms of semikernels modulo \(F\) ⋮ Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs

Cites Work

• On a class of kernel-perfect and kernel-perfect-critical graphs
• On kernel-perfect critical digraphs
• A note on kernel-critical graphs
• Graphes Noyau-Parfaits
• Unnamed Item

This page was built for publication: A combinatorial theorem on ordered circular sequences of \(n_1\) \(u\)'s and \(n_2\) \(v\)'s with application to kernel-perfect graphs