Pages that link to "Item:Q742575"
From MaRDI portal
The following pages link to Solving partition problems with colour-bipartitions (Q742575):
Displaying 8 items.
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Recognition of unipolar and generalised split graphs (Q1736638) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← 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)
- On the Polarity and Monopolarity of Graphs (Q5418774) (← links)
