Pages that link to "Item:Q2437850"
From MaRDI portal
The following pages link to Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850):
Displaying 15 items.
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- Polar graphs and maximal independent sets (Q860455) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Minimal obstructions to \(( \infty , k )\)-polarity in cographs (Q2032730) (← links)
- Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach (Q2200659) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- Line-Polar Graphs: Characterization and Recognition (Q3225119) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q5369516) (← links)
- On the Polarity and Monopolarity of Graphs (Q5418774) (← links)
- Recognizing hyperelliptic graphs in polynomial time (Q5919531) (← links)
- On two variants of split graphs: 2-unipolar graph and \(k\)-probe-split graph (Q6658477) (← links)
