A forbidden subgraph characterization of line-polar bipartite graphs

DOI10.1016/j.dam.2009.12.012zbMath1225.05201OpenAlexW2009197646MaRDI QIDQ968193

Jing Huang, Bao-Gang Xu

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

zbMATH Keywords

polar graphforbidden subgraph characterizationline-polar graphline-monopolar graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Recognizing line-polar bipartite graphs in time \(O(n)\) ⋮ List monopolar partitions of claw-free graphs ⋮ Complexity and algorithms for recognizing polar and monopolar graphs ⋮ On the Polarity and Monopolarity of Graphs ⋮ Algorithms for unipolar and generalized split graphs ⋮ Solving partition problems with colour-bipartitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: A forbidden subgraph characterization of line-polar bipartite graphs