scientific article; zbMATH DE number 3889565

From MaRDI portal
Publication:3222875





[For the entire collection see Zbl 0546.00006.] The paper investigates the class of graphs containing a set of vertices which meets exactly once every maximal clique. It gives characterization of strongly perfect graphs. In particular, it is shown that every strongly perfect graph is perfect.




Cited in
(70)








This page was built for publication:

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