23 citations · 43 across the 25 of their papers we have counts for
3 papers · 2 filters
Linear arboricity conjecture for infinite graphs
Leandro Aurichi, Rodrigo Santos Monteiro, Caio Fernando Rodrigues
The linear arboricity $\la(G)$ of a graph is the least cardinality of linear forests, that is, forests of maximum degree at most , into which its edge set can be deco…
Kriesell's conjecture for infinite graphs
Leandro Aurichi, Paulo Magalhães Júnior, Rodrigo Santos Monteiro
Let be a graph and be a subset of vertices. An -Steiner tree of is a tree of which contains in its vertex set . Kriesell conjectured…
Edge-ends versus topological ends of graphs
Leandro Aurichi, Paulo Magalhães Júnior, Guilherme Eduardo Pinto
Diestel and Kühn proved that the topological ends of an infinite graph are precisely its undominated graph ends, yielding a canonical embedding of the space of topological ends int…