A forbidden subgraph characterization of line-polar bipartite graphs
From MaRDI portal
Publication:968193
DOI10.1016/j.dam.2009.12.012zbMath1225.05201MaRDI QIDQ968193
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.12.012
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On the Polarity and Monopolarity of Graphs, List monopolar partitions of claw-free graphs, Recognizing line-polar bipartite graphs in time \(O(n)\), Algorithms for unipolar and generalized split graphs, Solving partition problems with colour-bipartitions, Complexity and algorithms for recognizing polar and monopolar graphs
Cites Work
- Recognizing line-polar bipartite graphs in time \(O(n)\)
- Polarity of chordal graphs
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- Complement reducible graphs
- Bisplit graphs
- Polar Permutation Graphs
- List Partitions
- Polar cographs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item