Recognition and isomorphism of tree-like P₄-connected graphs

DOI10.1016/S0166-218X(99)00140-7zbMATH0935.05077MaRDI QIDQ1962050FDOQ1962050

Authors Luitpold Babel

Publication date 26 April 2000

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Recommendations

• Tree-like \(P_4\)-connected graphs
• scientific article; zbMATH DE number 1051283
• scientific article; zbMATH DE number 4068899
• On the \(p\)-connectedness of graphs---a survey
• On a unique tree representation for \(P_ 4\)-extendible graphs

Cites work

• scientific article; zbMATH DE number 1003286 (Why is no real title available?)
• scientific article; zbMATH DE number 4206028 (Why is no real title available?)
• scientific article; zbMATH DE number 1107719 (Why is no real title available?)
• scientific article; zbMATH DE number 1456953 (Why is no real title available?)
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• A Linear Recognition Algorithm for Cographs
• A tree representation for \(P_ 4\)-sparse graphs
• Complement reducible graphs
• Graph theory with applications
• Hamiltonicity in graphs with few \(P_ 4\)'s
• Linear time optimization algorithms for \(P_ 4\)-sparse graphs
• On a unique tree representation for \(P_ 4\)-extendible graphs
• On the structure of graphs with few \(P_4\)s
• P-Components and the Homogeneous Decomposition of Graphs
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• Tree-like \(P_4\)-connected graphs
• Triangulating graphs with few \(P_4\)'s
• Weakly triangulated graphs

Cited in

(11)

• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• A new characterization of \(P_4\)-connected graphs
• Recognizing the \(P_ 4\)-structures of a tree
• On a unique tree representation for \(P_ 4\)-extendible graphs
• scientific article; zbMATH DE number 4068899 (Why is no real title available?)
• scientific article; zbMATH DE number 2081001 (Why is no real title available?)
• Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles
• Tree-like \(P_4\)-connected graphs
• A time-based solution for the graph isomorphism problem
• Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
• scientific article; zbMATH DE number 1953107 (Why is no real title available?)

This page was built for publication: Recognition and isomorphism of 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 Q1962050)