On kernels in perfect graphs
From MaRDI portal
Publication:684411
DOI10.1007/BF01303206zbMath0780.05020MaRDI QIDQ684411
Pierre Duchet, Frédéric Maffray, Mostafa Blidia
Publication date: 15 September 1993
Published in: Combinatorica (Search for Journal in Brave)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Perfect graphs are kernel solvable, Perfectly orderable graphs and almost all perfect graphs are kernel \(M\)- solvable, Kernels in a special class of digraphs, Stable effectivity functions and perfect graphs, Perfect graphs, kernels, and cores of cooperative games, Recent problems and results about kernels in directed graphs
Cites Work