Pages that link to "Item:Q1786593"
From MaRDI portal
The following pages link to Parameterized algorithms for conflict-free colorings of graphs (Q1786593):
Displaying 14 items.
- Complexity of conflict-free colorings of graphs (Q484316) (← links)
- Minimum conflict free colouring parameterized by treewidth (Q779250) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Conflict-free coloring: graphs of bounded clique width and intersection graphs (Q2115843) (← links)
- Conflict-free coloring bounds on open neighborhoods (Q2161000) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- A tight bound for conflict-free coloring in terms of distance to cluster (Q2166302) (← links)
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Parameterized algorithms for load coloring problem (Q2448120) (← links)
- Parameterized and exact algorithms for class domination coloring (Q2659082) (← links)
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs (Q2864316) (← links)
- Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs (Q5745127) (← links)
- Backdoor DNFs (Q6564620) (← links)
- Conflict-free coloring: graphs of bounded clique-width and intersection graphs (Q6582374) (← links)