Some notes on bounded starwidth graphs
From MaRDI portal
Publication:2628278
DOI10.1016/j.ipl.2017.04.011zbMath1416.05264OpenAlexW2608596666MaRDI QIDQ2628278
Publication date: 13 June 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2017.04.011
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- On the complexity of edge labelings for trees
- The complexity of harmonious colouring for trees
- Graph minors. XIII: The disjoint paths problem
- Tree-depth, subgraph coloring and homomorphism bounds
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The minimum latency problem
- Reducibility among Combinatorial Problems
This page was built for publication: Some notes on bounded starwidth graphs