scientific article; zbMATH DE number 4179414

MaRDI QIDQ3203055zbMATH OpenFDO

Authors C. Berge

Publication date 1984

zbMATH Keywords

stochasticstrongly perfect graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 3889565
• Some classes of strongly perfect graphs
• scientific article; zbMATH DE number 3926973
• scientific article; zbMATH DE number 4093506
• scientific article; zbMATH DE number 4041969

Cited in

(6)

• On randomized stopping points and perfect graphs
• Cycle stochastic graphs: structural and forbidden graph characterizations
• Clique graph characterizations of strongly chordal graphs
• Parity graphs are kernel-M-solvable
• Stochastic incompleteness for graphs and weak Omori-Yau maximum principle
• Simple bounds and greedy algorithms for decomposing a flow into a minimal set of paths

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 Q3203055)