Perfect graphs

MaRDI QIDQ4635984zbMATH OpenFDO

Authors R. Sritharan, Chính T. Hoàng

Publication date 23 April 2018

zbMATH Keywords

minimum coloringlargest clique

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Recommendations

• scientific article; zbMATH DE number 3851153
• scientific article; zbMATH DE number 108587
• scientific article; zbMATH DE number 3859178
• scientific article; zbMATH DE number 3869356
• Some classes of perfectly orderable graphs

Cited in

(18)

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Preperfect graphs
• Complete graphs in the Rubáiyát
• Circular perfect graphs
• Two classes of perfect graphs
• Hardly perfect graphs
• scientific article; zbMATH DE number 5531989 (Why is no real title available?)
• -boundedness and related problems on graphs without long induced paths: a survey
• An algorithm for coloring some perfect graphs
• scientific article; zbMATH DE number 1944138 (Why is no real title available?)
• scientific article; zbMATH DE number 3869356 (Why is no real title available?)
• Wing-triangulated graphs are perfect
• Perfect graph decompositions
• scientific article; zbMATH DE number 3851153 (Why is no real title available?)
• Square-free perfect graphs.
• scientific article; zbMATH DE number 108587 (Why is no real title available?)
• scientific article; zbMATH DE number 3941576 (Why is no real title available?)
• scientific article; zbMATH DE number 444736 (Why is no real title available?)

This page was built for publication: Perfect graphs

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