Pages that link to "Item:Q5858645"
From MaRDI portal
The following pages link to Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645):
Displaying 5 items.
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- (Q3304125) (← links)
- Tight Bounds for Graph Homomorphism and Subgraph Isomorphism (Q4575696) (← links)
- Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs (Q5146875) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)