On unavoidability of trees with \(k\) leaves

DOI10.1007/s00373-002-0483-yzbMath1022.05014OpenAlexW1990037810MaRDI QIDQ1396655

Frédéric Havet

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

zbMATH Keywords

tournamentoriented tree

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20)

Related Items (10)

Trees with few leaves in tournaments ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Unnamed Item ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Trees with three leaves are (\(n+1\))-unavoidable ⋮ Tournaments and Semicomplete Digraphs

This page was built for publication: On unavoidability of trees with \(k\) leaves