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

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

Authors: Luitpold Babel 

Publication date: 26 April 2000

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

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

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)

Cites Work

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

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a unique tree representation for \(P_ 4\)-extendible graphs
• Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
• Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• Recognizing the \(P_ 4\)-structures of a tree
• Tree-like \(P_4\)-connected graphs
• Title not available (Why is that?)
• A time-based solution for the graph isomorphism problem

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)