Stochastic graphs and strongly perfect graphs - a survey

MaRDI QIDQ1051657zbMATH OpenFDO

Authors C. Berge

Publication date 1983

Published in Southeast Asian Bulletin of Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberclique numberinduced subgraphsweight functionperfect graphsstochastic graphsstrongly perfect

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Cited in

(5)

• Computing well-covered vector spaces of graphs using modular decomposition
• Graphs vertex-partitionable into strong cliques
• On equistable, split, CIS, and related classes of graphs
• Detecting strong cliques
• Strong cliques in vertex‐transitive graphs

This page was built for publication: Stochastic graphs and strongly perfect graphs - a survey

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