Tree-like P₄-connected graphs

DOI10.1016/S0012-365X(98)00088-0zbMATH Open0956.05091MaRDI QIDQ1584426FDOQ1584426

Authors: Luitpold Babel 

Publication date: 2 November 2000

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

Recommendations

• Recognition and isomorphism of tree-like \(P_4\)-connected graphs
• On the \(P_4\)-components of graphs
• On the \(p\)-connectedness of graphs---a survey
• Recognizing the \(P_ 4\)-structures of a tree
• scientific article; zbMATH DE number 4068899

zbMATH Keywords

treespartitioncharacterizationcographs\(P_4\)-structure\(p\)-connected graphs\(p\)-trees

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• The 4-set tree connectivity of \((n, k)\)-star networks
• Title not available (Why is that?)
• On a unique tree representation for \(P_ 4\)-extendible graphs
• Endomorphism-regularity of split graphs
• Title not available (Why is that?)
• Recognizing the \(P_ 4\)-structures of a tree
• Recognition and isomorphism of tree-like \(P_4\)-connected graphs
• A new characterization of \(P_4\)-connected graphs
• Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584426)