Some classes of strongly perfect graphs

DOI10.1016/S0012-365X(98)00407-5MaRDI QIDQ1304823zbMATH OpenOpenAlexWikidataFDO

Authors G. Ravindra

Publication date 2 January 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00407-5

zbMATH Keywords

chromatic numbercomparability graphcostrongly perfect graphindependent setline graphMeyniel graphstrongly perfect graph

Mathematics Subject Classification ID

Perfect graphs (05C17) Structural characterization of families of graphs (05C75)

Review text

A graph is said to be strongly perfect if each of its induced subgraphs \(H\) contains an independent set which meets all the cliques (maximal complete subgraphs) in it. Every strongly perfect graph is perfect but the converse is generally not valid. Meyniel graphs, line graphs that are free from some graphs, comparability graphs, costrongly perfect graphs are some of the most important classes of strongly perfect graphs. In this paper the results concerning strongly perfect graphs are summarized.

Recommendations

• scientific article; zbMATH DE number 3926973
• scientific article; zbMATH DE number 3889565
• scientific article; zbMATH DE number 4041969
• New examples of minimal non-strongly-perfect graphs
• scientific article; zbMATH DE number 1043906

Cited in

(22)

• A class of strongly perfect graphs
• New classes of perfect graphs
• Two classes of perfect graphs
• Strongly perfect infinite graphs
• Depth and regularity of monomial ideals via polarization and combinatorial optimization
• Which claw-free graphs are strongly perfect?
• New examples of minimal non-strongly-perfect graphs
• scientific article; zbMATH DE number 4179414 (Why is no real title available?)
• scientific article; zbMATH DE number 3884201 (Why is no real title available?)
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 4142088 (Why is no real title available?)
• scientific article; zbMATH DE number 3926973 (Why is no real title available?)
• scientific article; zbMATH DE number 4041969 (Why is no real title available?)
• scientific article; zbMATH DE number 4093506 (Why is no real title available?)
• Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
• scientific article; zbMATH DE number 1043906 (Why is no real title available?)
• Structural properties of super strongly perfect graphs
• scientific article; zbMATH DE number 846971 (Why is no real title available?)
• Super strongly perfect graphs
• Structure of super strongly perfect graphs
• Strongly perfect claw‐free graphs—A short proof
• The regularity and unimodality of h-polynomial of corona graphs

This page was built for publication: Some classes of strongly perfect graphs

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