A combinatorial theorem on ordered circular sequences of n₁ u's and n₂ v's with application to kernel-perfect graphs

DOI10.1007/S10255-003-0079-1MaRDI QIDQ1873579zbMATH OpenOpenAlexFDO

Authors Xiaofeng Guo, Yi Huang

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)

Recommendations

• On kernel-perfect critical digraphs
• Some results on the structure of kernel-perfect and critical kernel-imperfect digraphs
• The kernel in special directed circular graphs
• A sufficient condition for a digraph to be kernel-perfect
• Unions of digraphs which become kernel perfect

Cites work

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

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1873579)