A new characterization of perfect graphs

DOI10.1016/j.disc.2012.04.018zbMath1245.05056OpenAlexW2094974037MaRDI QIDQ442410

Hortensia Galeana-Sánchez

Publication date: 10 August 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.04.018

zbMATH Keywords

kernelperfect graph

Mathematics Subject Classification ID

Perfect graphs (05C17)

Related Items (2)

Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs ⋮ CKI-digraphs, generalized sums and partitions of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• On kernel-perfect critical digraphs
• Perfect graphs are kernel solvable
• Perfect graphs, kernels, and cores of cooperative games
• Recent problems and results about kernels in directed graphs

This page was built for publication: A new characterization of perfect graphs