scientific article; zbMATH DE number 3884201

MaRDI QIDQ3218157zbMATH OpenFDO

Authors G. Ravindra

Publication date 1984

zbMATH Keywords

cliquesMeyniel's conditionperfect graphsstable set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• On a conjecture of Meyniel
• Some classes of strongly perfect graphs
• Strongly perfect infinite graphs
• scientific article; zbMATH DE number 3889565
• Progress on perfect graphs

Cited in

(13)

• New classes of perfect graphs
• On a conjecture of Meyniel
• Slim graphs
• Short-chorded and perfect graphs
• On slim graphs, even pairs, and star-cutsets
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
• Efficient parallel recognition algorithms of cographs and distance hereditary graphs
• Meyniel weakly triangulated graphs. II: A theorem of Dirac
• Irredundance
• scientific article; zbMATH DE number 3904622 (Why is no real title available?)
• Coloring vertices of a graph or finding a Meyniel obstruction
• Research problems
• A note on graphs which have upper irredundance equal to independence

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