scientific article; zbMATH DE number 4068899

From MaRDI portal
Publication:3801571





[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\).











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