Pages that link to "Item:Q4210668"
From MaRDI portal
The following pages link to On the computational complexity of (O,P)-partition problems (Q4210668):
Displayed 9 items.
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Computational aspects of greedy partitioning of graphs (Q1702844) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- (Q5009615) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- Between 2- and 3-colorability (Q5902303) (← links)
- Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration (Q6056774) (← links)