Pages that link to "Item:Q342709"
From MaRDI portal
The following pages link to The parameterised complexity of list problems on graphs of bounded treewidth (Q342709):
Displaying 6 items.
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5874480) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- On the linear arboricity of graphs with treewidth at most four (Q6172210) (← links)
