A forbidden subgraph characterization of line-polar bipartite graphs

DOI10.1016/J.DAM.2009.12.012zbMATH Open1225.05201OpenAlexW2009197646MaRDI QIDQ968193FDOQ968193

Authors: Jing Huang, Baogang 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

Recommendations

• Recognizing line-polar bipartite graphs in time \(O(n)\)
• Line-Polar Graphs: Characterization and Recognition
• Polar cographs
• Polar cographs
• Polar permutation graphs

zbMATH Keywords

forbidden subgraph characterizationline-polar graphpolar graphline-monopolar graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Complement reducible graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• List Partitions
• Bisplit graphs
• About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
• Polar permutation graphs
• Polar cographs
• Recognizing line-polar bipartite graphs in time \(O(n)\)
• Polarity of chordal graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Title not available (Why is that?)
• 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
• Forbidden subgraphs for graphs with line graphs of crossing number \(\leq 1\)
• Line graphs and forbidden induced subgraphs
• 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)