4 citations · 5 across the 4 of their papers we have counts for
4 papers · 1 filter
Bounded Diameter Arboricity
Martin Merker, Luke Postle
We introduce the notion of \emph{bounded diameter arboricity}. Specifically, the \emph{diameter- arboricity} of a graph is the minimum number such that the edges of the grap…
Decomposing graphs into a constant number of locally irregular subgraphs
Julien Bensmail, Martin Merker, Carsten Thomassen
A graph is locally irregular if no two adjacent vertices have the same degree. The irregular chromatic index of a graph is the smallest number of locally irre…
Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
Martin Merker
The Tree Decomposition Conjecture by Barát and Thomassen states that for every tree there exists a natural number such that the following holds: If is a -edge-…
A Proof of the Barát-Thomassen Conjecture
Julien Bensmail, Ararat Harutyunyan, Tien-Nam Le +2
The Barát-Thomassen conjecture asserts that for every tree on edges, there exists a constant such that every -edge-connected graph with size divisible by can…