No label defined (Q3783329)

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 4045795
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4045795

      Statements

      0 references
      1987
      0 references
      no cocycles
      0 references
      peripheral graphs
      0 references
      chordal graphs
      0 references
      no cycles
      0 references
      [For the entire collection see Zbl 0638.00009.] A graph G is said to be peripheral if every induced subgraph \(G'\subseteq G\) contains a vertex which is simplicial either in G' or in its complement \(\bar G'\). The family of peripheral graphs turns out to be a natural extension of chordal graphs and their complements, and peripheral graphs contain no cycles and cocycles of length at least 5 as induced subgraphs. We show that peripheral graphs are perfectly orderable (and thus perfect) and propose the problem of finding structural characterization for the family.
      0 references

      Identifiers