Pages that link to "Item:Q527415"
From MaRDI portal
The following pages link to List H-coloring a graph by removing few vertices (Q527415):
Displaying 14 items.
- Multi-budgeted directed cuts (Q786027) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- (Q2849322) (redirect page) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- (Q5874546) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)
- Parameterized complexity of weighted multicut in trees (Q6039425) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- List homomorphism: beyond the known boundaries (Q6164000) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
