Recognizing the P₄-structure of block graphs

DOI10.1016/S0166-218X(99)00145-6zbMATH Open0940.05033OpenAlexW2060080121MaRDI QIDQ1962056FDOQ1962056

Authors: 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

Recommendations

• The \(P_4\)-structure of perfect graphs
• Recognizing the \(P_4\)-structure of bipartite graphs
• scientific article; zbMATH DE number 2119686
• Recognizing the \(P_ 4\)-structures of a tree
• On the structure of graphs with few \(P_4\)s

zbMATH Keywords

hypergraph

Mathematics Subject Classification ID

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

Cites Work

• A semi-strong perfect graph theorem
• Title not available (Why is that?)
• On the \(P_ 4\)-structure of perfect graphs. III: Partner decompositions
• Recognizing the \(P_ 4\)-structures of a tree

Cited In (8)

• Title not available (Why is that?)
• Recognizing well covered graphs of families with special \(P _{4}\)-components
• Recognizing the \(P_4\)-structure of bipartite graphs
• The \(P_4\)-structure of perfect graphs
• Bipartite-perfect graphs
• Recognizing the \(P_ 4\)-structures of a tree
• The \(A_4\)-structure of a graph
• Title not available (Why is that?)

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

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