Research problems

DOI10.1016/0012-365X(90)90301-WMaRDI QIDQ5972135zbMATH OpenFDO

Authors G. Ravindra

Publication date 1990

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(90)90301-W

zbMATH Keywords

characterization of strongly perfect graphsforbidden subgraphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• New examples of minimal non-strongly-perfect graphs
• scientific article; zbMATH DE number 3926973
• scientific article; zbMATH DE number 3884201
• Progress on perfect graphs
• scientific article; zbMATH DE number 3869356

Cites work

• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3926973 (Why is no real title available?)
• scientific article; zbMATH DE number 4093506 (Why is no real title available?)
• scientific article; zbMATH DE number 637619 (Why is no real title available?)
• scientific article; zbMATH DE number 844709 (Why is no real title available?)
• Meyniel graphs are strongly perfect
• Perfect product graphs
• Perfectness of normal products of graphs
• Topics on perfect graphs

Cited in

(4)

• Research problem 40
• Which claw-free graphs are strongly perfect?
• New examples of minimal non-strongly-perfect graphs
• Strongly perfect claw‐free graphs—A short proof

This page was built for publication: Research problems

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