|
Ergebnis 1 - 10 von 14
1
2
Vorwärts
Gehe zu Seite
von 2
|
| 1. |
Joó, Attila
(2018)
Countable Menger's theorem with finitary matroid constraints on the ingoing edges
Bericht / Forschungsbericht / Abhandlung
|
| 2. |
Joó, Attila
(2015)
Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair
Bericht / Forschungsbericht / Abhandlung
|
| 3. |
Joó, Attila
(2016)
Gomory-Hu trees of infinite graphs with finite total weight
Bericht / Forschungsbericht / Abhandlung
|
| 4. |
Joó, Attila
(2014)
Edmods' branching theorem in digraphs withoutforward-infinite paths
Bericht / Forschungsbericht / Abhandlung
|
| 5. |
Joó, Attila
(2015)
Packing countably many branchings with prescribed root-sets in infinite digraphs
Bericht / Forschungsbericht / Abhandlung
|
| 6. |
Joó, Attila
(2015)
On partitioning the edges of an infinite digraph into directed cycles
Bericht / Forschungsbericht / Abhandlung
|
| 7. |
Joó, Attila
(2019)
The complete lattice of erdos-menger separations
Bericht / Forschungsbericht / Abhandlung
|
| 8. |
Joó, Attila
(2019)
On the growth rate of dichromatic numbers of finite subdigraphs
Bericht / Forschungsbericht / Abhandlung
|
| 9. |
Joó, Attila
(2020)
On a linking property of infinite matroids
Bericht / Forschungsbericht / Abhandlung
|
| 10. |
Joó, Attila
(2020)
Intersection of a partitional and a general infinite matroid
Bericht / Forschungsbericht / Abhandlung
|
|
Ergebnis 1 - 10 von 14
1
2
Vorwärts
Gehe zu Seite
von 2
|
