Recognizing the \(P_ 4\)-structures of a tree

DOI10.1007/BF02986682zbMath0812.05014OpenAlexW2070604927MaRDI QIDQ1343225

Guoli Ding

Publication date: 1 February 1995

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02986682

zbMATH Keywords

treehypergraphpolynomial time algorithm\(P_ 4\)-structure

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Recognizing the \(P_4\)-structure of block graphs ⋮ Bipartite-perfect graphs ⋮ Recognizing the \(P_4\)-structure of bipartite graphs

Cites Work

• Unnamed Item
• A semi-strong perfect graph theorem
• On the \(P_ 4\)-structure of perfect graphs. III: Partner decompositions

This page was built for publication: Recognizing the \(P_ 4\)-structures of a tree