scientific article; zbMATH DE number 3878985

From MaRDI portal
Publication:3344031





[For the entire collection see Zbl 0535.00030.] The Meyniel graphs are perfect graphs in which every odd elementary cycle of length at least five contains at least two chords. The paper shows that the recognition problem of a Meyniel graph is polynomial by presenting a polynomial recognition algorithm. As a by-product the authors obtain new results concerning some classes contained in Meyniel graphs: triangulated graphs, o-triangulated graphs and parity graphs.











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