Pages that link to "Item:Q5418774"
From MaRDI portal
The following pages link to On the Polarity and Monopolarity of Graphs (Q5418774):
Displayed 11 items.
- List monopolar partitions of claw-free graphs (Q442362) (← links)
- Solving partition problems with colour-bipartitions (Q742575) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← 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)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- Monopolar graphs: complexity of computing classical graph parameters (Q2659081) (← links)
- (Q5009615) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)