1 citations · 1 across the 4 of their papers we have counts for
4 papers
The complexity of decomposing a graph into a matching and a bounded linear forest
Agnijo Banerjee, João Pedro Marciano, Adva Mond +2
Deciding whether a graph can be edge-decomposed into a matching and a -bounded linear forest was recently shown by Campbell, H{ö}rsch and Moore to be NP-complete for every $k \g…
Bounds for the Competition-Independence game on trees
Jan Petr, Julien Portier
In this paper we prove that Sweller has a strategy so that the Sweller-Start Competition-Independence game lasts at least moves for every tree. Moreover, we show that t…
On interval colourings of graphs
Lawrence Hollom, Julien Portier, Leo Versteegen
An interval colouring of a graph is a proper colouring such that the set of colours of edges incident to any given vertex forms an interval of $…
Progress towards the 1/2-Conjecture for the domination game
Julien Portier, Leo Versteegen
The domination game is played on a graph by two players, Dominator and Staller, who alternate in selecting vertices until each vertex in the graph is contained in the close…