For any integer 𝑘 ≥ 2, a graph 𝐺 is called 𝑘-leaf-connected if |V(G)|≥k+1 and given any subset 𝑆 ⊆ 𝑉(𝐺) with |S|=k,G always has a spanning tree 𝑇 such that 𝑆 is precisely the set of leaves of ...

For most of us, the word graph brings back memories (not always pleasant) of pencils and rulers and quadrille ruled paper, though a more recent generation may think instead of pie and bar charts ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...