Recognizing the \(P_4\)-structure of block graphs

DOI10.1016/S0166-218X(99)00145-6zbMath0940.05033OpenAlexW2060080121MaRDI QIDQ1962056

Andreas Brandstädt, Van Bang Le

Publication date: 16 July 2000

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00145-6

zbMATH Keywords

hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)

Related Items

Bipartite-perfect graphs

Cites Work

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

This page was built for publication: Recognizing the \(P_4\)-structure of block graphs