Structural properties of super strongly perfect graphs

DOI10.1142/S1793830918500532MaRDI QIDQ4577861zbMATH OpenOpenAlexWikidataFDO

Authors T. E. Soorya, Sunil Mathew

Publication date 3 August 2018

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830918500532

zbMATH Keywords

cliquegraphminimal dominating setsuper strongly perfect graph

Mathematics Subject Classification ID

Perfect graphs (05C17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• Structure of super strongly perfect graphs
• SSP-cyclic structure of some circulant graphs
• Some classes of strongly perfect graphs
• Super strongly perfect graphs
• New examples of minimal non-strongly-perfect graphs

Cites work

• Classes of perfect graphs
• scientific article; zbMATH DE number 5991641 (Why is no real title available?)
• Meyniel graphs are strongly perfect
• Progress on perfect graphs
• Some classes of strongly perfect graphs
• The strong perfect graph theorem
• Which claw-free graphs are strongly perfect?

Cited in

(5)

• On superperfect noncomparability graphs
• Super strongly perfect graphs
• Structure of super strongly perfect graphs
• SSP-cyclic structure of some circulant graphs
• scientific article; zbMATH DE number 238425 (Why is no real title available?)

This page was built for publication: Structural properties of super strongly perfect graphs

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