Tree-like \(P_4\)-connected graphs

DOI10.1016/S0012-365X(98)00088-0zbMath0956.05091MaRDI QIDQ1584426

Luitpold Babel

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitioncharacterizationtrees\(P_4\)-structurecographs\(p\)-connected graphs\(p\)-trees

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (3)

Recognition and isomorphism of tree-like \(P_4\)-connected graphs ⋮ Endomorphism-regularity of split graphs ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs

Cites Work

• Unnamed Item
• Weakly triangulated graphs
• Complement reducible graphs
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A tree representation for \(P_ 4\)-sparse graphs
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• P-Components and the Homogeneous Decomposition of Graphs

This page was built for publication: Tree-like \(P_4\)-connected graphs