The following pages link to Polar cographs (Q5900347):
Displaying 20 items.
- List monopolar partitions of claw-free graphs (Q442362) (← links)
- Recognizing line-polar bipartite graphs in time \(O(n)\) (Q602675) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- A forbidden subgraph characterization of line-polar bipartite graphs (Q968193) (← links)
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs (Q1084418) (← links)
- Bi-complement reducible graphs (Q1356114) (← links)
- \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs (Q1598808) (← links)
- Recognition of unipolar and generalised split graphs (Q1736638) (← links)
- Polar permutation graphs are polynomial-time recognisable (Q1933641) (← links)
- Recognizing \(k\)-path graphs (Q1962042) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs (Q2184672) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- (Q4691790) (← links)
- On the Polarity and Monopolarity of Graphs (Q5418774) (← links)
- Polar cographs (Q5899394) (← links)
- On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph (Q6658477) (← links)
