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

DOI10.1016/S0166-218X(99)00104-3zbMath0931.68074OpenAlexW2027575036WikidataQ127720535 ScholiaQ127720535MaRDI QIDQ1296570

Luitpold Babel, Andreas Brandstädt, Van Bang Le

Publication date: 2 August 1999

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

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

zbMATH Keywords

bipartite graph\(P_4\)-structure

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Related Items (2)

Parameterized algorithms for edge biclique and related problems ⋮ Bipartite-perfect graphs

Cites Work

• A semi-strong perfect graph theorem
• On the \(p\)-connectedness of graphs---a survey
• Recognizing the \(P_ 4\)-structures of a tree
• P-Components and the Homogeneous Decomposition of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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