Spotting Trees with Few Leaves
From MaRDI portal
Publication:5346548
DOI10.1137/15M1048975zbMath1362.05078MaRDI QIDQ5346548
Meirav Zehavi, Andreas Björklund, Łukasz Kowalik, Vikram Kamat
Publication date: 24 May 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Hamiltonian cycle; coloring; fractional coloring; \(k\)-path; parameterized complexity; algebraic techniques; vector coloring; \(k\)-internal spanning tree
05C05: Trees
68W05: Nonnumerical algorithms
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
68W20: Randomized algorithms
05C45: Eulerian and Hamiltonian graphs