A forbidden subgraph characterization of line-polar bipartite graphs
From MaRDI portal
(Redirected from Publication:968193)
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3961672 (Why is no real title available?)
- scientific article; zbMATH DE number 3977053 (Why is no real title available?)
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- Bisplit graphs
- Complement reducible graphs
- List Partitions
- Polar cographs
- Polar permutation graphs
- Polarity of chordal graphs
- Recognizing line-polar bipartite graphs in time \(O(n)\)
Cited in
(9)- Algorithms for unipolar and generalized split graphs
- Solving partition problems with colour-bipartitions
- scientific article; zbMATH DE number 1186102 (Why is no real title available?)
- Line graphs and forbidden induced subgraphs
- On the Polarity and Monopolarity of Graphs
- Forbidden subgraphs for graphs with line graphs of crossing number \(\leq 1\)
- List monopolar partitions of claw-free graphs
- Recognizing line-polar bipartite graphs in time \(O(n)\)
- Complexity and algorithms for recognizing polar and monopolar graphs
This page was built for publication: A forbidden subgraph characterization of line-polar bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968193)