5 citations · 12 across the 15 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
math.CO2018
On the minimum leaf number of cubic graphs
Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput +1
The \emph{minimum leaf number} of a connected graph is defined as the minimum number of leaves of the spanning trees of . We present new results concerning t…
math.CO2018
Single-conflict colouring
Zdeněk Dvořák, Louis Esperet, Ross J. Kang +1
Given a multigraph, suppose that each vertex is given a local assignment of colours to its incident edges. We are interested in whether there is a choice of one local colour pe…