Bipartite-perfect graphs

DOI10.1016/S0166-218X(02)00390-6zbMath1019.05028MaRDI QIDQ1811078

Van Bang Le

Publication date: 10 June 2003

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

zbMATH Keywords

bipartite graphperfect graphmodular decomposition\(P_4\)-connected graph\(P_4\)-structure of graphs

Mathematics Subject Classification ID

Perfect graphs (05C17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• A semi-strong perfect graph theorem
• Recognizing the \(P_4\)-structure of bipartite graphs
• Modular decomposition and transitive orientation
• Tree- and forest-perfect graphs
• Recognizing the \(P_ 4\)-structures of a tree
• Recognizing the \(P_4\)-structure of block graphs
• A Linear Recognition Algorithm for Cographs
• Graph Classes: A Survey
• Split-Perfect Graphs: Characterizations and Algorithmic Use
• P-Components and the Homogeneous Decomposition of Graphs
• Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles

This page was built for publication: Bipartite-perfect graphs