Name
Abstract | ||
|---|---|---|
Let TTn be a transitive tournament on n vertices. We show that for any directed acyclic graph G of order n and of size not greater than two directed graphs isomorphic to G are arc disjoint subgraphs of TTn. Moreover, this bound is generally the best possible. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s00373-005-0652-x | Graphs and Combinatorics |
Keywords | Field | DocType |
transitive tournaments,packing of digraphs,directed graph,directed acyclic graph | Discrete mathematics,Topology,Combinatorics,Comparability graph,Transitive reduction,Transpose graph,Clebsch graph,Cycle graph,Directed acyclic graph,Symmetric graph,Mathematics,Feedback arc set | Journal |
Volume | Issue | ISSN |
22 | 2 | 1435-5914 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Agnieszka Görlich | 1 | 27 | 9.19 |
| Monika Pilsniak | 2 | 29 | 5.42 |
| Mariusz Wozniak | 3 | 111 | 19.51 |