No label defined (Q3801571)

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

      Statements

      1987
      0 references
      \(P_ 4\)-tree
      0 references
      cotree
      0 references
      0 references
      [For the entire collection see Zbl 0638.00009.] This paper introduces the concept of a \(P_ 4\)-tree. A \(P_ 4\) is a chordless path of 4 vertices (and 3 edges). A graph without any \(P_ 4\) induced subgraph is called a cograph and has a unique tree representation called a cotree. A \(P_ 4\)-tree essentially makes a node for a \(P_ 4\) and then partitions the vertices of the graph into five subtrees of this node, where the partition is based on adjacencies with the vertices in the \(P_ 4\).
      0 references

      Identifiers