On kernels in perfect graphs

DOI10.1007/BF01303206zbMath0780.05020OpenAlexW1983199480MaRDI QIDQ684411

Frédéric Maffray, Mostafa Blidia, Pierre Duchet

Publication date: 15 September 1993

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01303206

zbMATH Keywords

digraphindependent setkernelperfect graphscliquestrongly perfect graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Recent problems and results about kernels in directed graphs, Kernels in a special class of digraphs, Perfect graphs are kernel solvable, Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3, On the kernel and related problems in interval digraphs, Perfect graphs, kernels, and cores of cooperative games, Stable effectivity functions and perfect graphs, Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable, Kernels by monochromatic paths in digraphs with covering number 2

Cites Work

• Unnamed Item
• On kernels and semikernels of digraphs
• Topics on perfect graphs
• A parity digraph has a kernel
• Parity graphs are kernel-M-solvable
• On kernels in i-triangulated graphs
• Kernels in some orientations of comparability graphs
• Graphes Noyau-Parfaits