Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles

DOI10.1007/s003730070002zbMath0998.05038OpenAlexW1996773256MaRDI QIDQ5935599

Andreas Brandstädt, Van Bang Le, Stephan Olariu

Publication date: 2000

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

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

zbMATH Keywords

pathsalgorithmbipartite graphcyclesuniform hypergraphtrees\(P_4\)-structureperfect graph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Bipartite-perfect graphs