A class of strongly perfect graphs

DOI10.1016/0012-365X(85)90070-6MaRDI QIDQ1060228zbMATH OpenFDO

Authors Myriam Preissmann

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(85)90070-6

zbMATH Keywords

Dilworth numberstrongly perfect graphvicinal preorder

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)

Review text

It is shown that graphs which do not have more than 3 mutually uncomparable vertices for the vicinal preorder are strongly perfect. Answering to a question of the author, \textit{N. V. R. Mahadev} [Ph. D. Thesis, Waterloo (Ontario) 1984] has later shown that such graphs are moreover perfectly orderable.

Recommendations

• Some classes of strongly perfect graphs
• scientific article; zbMATH DE number 3889565
• Generalized neighbourhoods and a class of perfectly orderable graphs
• New properties of perfectly orderable graphs and strongly perfect graphs
• scientific article; zbMATH DE number 4093506

Cites work

• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3891425 (Why is no real title available?)
• Meyniel graphs are strongly perfect
• Perfectness and Dilworth number

Cited in

(9)

• Generalized neighbourhoods and a class of perfectly orderable graphs
• A semi-strong perfect graph theorem
• Two classes of perfect graphs
• New properties of perfectly orderable graphs and strongly perfect graphs
• Strongly perfect infinite graphs
• Coloring the cliques of line graphs
• New examples of minimal non-strongly-perfect graphs
• scientific article; zbMATH DE number 3887731 (Why is no real title available?)
• Structure of super strongly perfect graphs

This page was built for publication: A class of strongly perfect graphs

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