On unavoidability of trees with \(k\) leaves
From MaRDI portal
Publication:1396655
DOI10.1007/s00373-002-0483-yzbMath1022.05014MaRDI QIDQ1396655
Publication date: 8 July 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-002-0483-y
Related Items
On the unavoidability of oriented trees, On the unavoidability of oriented trees, \(L(d,1)\)-labelings of the edge-path-replacement of a graph, An approximate version of Sumner's universal tournament conjecture, Trees with three leaves are (\(n+1\))-unavoidable, Trees with few leaves in tournaments, Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter, \(L(2, 1)\)-labelings of the edge-path-replacement of a graph, Unnamed Item, Tournaments and Semicomplete Digraphs