Recognizing the P₄-structure of bipartite graphs
DOI10.1016/S0166-218X(99)00104-3zbMATH Open0931.68074OpenAlexW2027575036WikidataQ127720535 ScholiaQ127720535MaRDI QIDQ1296570FDOQ1296570
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
Recommendations
- Recognizing the \(P_4\)-structure of block graphs
- On the recognition of bipolarizable and \(P_4\)-simplicial graphs
- Recognizing bipolarizable and \(P _{4}\)-simplicial graphs.
- On the recognition of \(P_4\)-indifferent graphs
- Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles
- scientific article; zbMATH DE number 1953107
- On the \(P_4\)-components of graphs
- \(P_4\)-colorings and \(P_4\)-bipartite graphs
- On the structure of graphs with few \(P_4\)s
- Recognizing the \(P_ 4\)-structures of a tree
Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)
Cites Work
Cited In (11)
- Title not available (Why is that?)
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Parameterized algorithms for edge biclique and related problems
- Recognizing the \(P_4\)-structure of block graphs
- Split-Perfect Graphs: Characterizations and Algorithmic Use
- Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles
- The \(P_4\)-structure of perfect graphs
- Bipartite-perfect graphs
- Recognizing the \(P_ 4\)-structures of a tree
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Recognizing the \(P_4\)-structure of bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296570)
