Pages that link to "Item:Q1885051"
From MaRDI portal
The following pages link to The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete (Q1885051):
Displaying 4 items.
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- Critical elements in combinatorially closed families of graph classes (Q5269161) (← 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)