No label defined (Q3344031)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3878985
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3878985

      Statements

      0 references
      0 references
      1984
      0 references
      perfect graphs
      0 references
      Meyniel graph
      0 references
      triangulated graphs
      0 references
      parity graphs
      0 references
      [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.
      0 references

      Identifiers