?-Perfect graphs

DOI10.1007/BF01068603MaRDI QIDQ4007468zbMATH OpenOpenAlexFDO

Authors G. S. Gasparyan, S. E. Markosyan

Publication date 27 September 1992

Published in Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic number\(\omega\)-perfect graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 4063146
• Perfect graphs
• Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
• scientific article; zbMATH DE number 4183452
• On -perfect graphs.

Cites work

• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A characterization of perfect graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Topics on perfect graphs
• Triangulated graphs and the elimination process

Cited in

(6)

• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
• Conditions for β-perfectness
• scientific article; zbMATH DE number 4063146 (Why is no real title available?)
• On -perfect graphs.
• \(\omega\)-periodic graphs

This page was built for publication: ?-Perfect graphs

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