5 citations · 7 across the 5 of their papers we have counts for
5 papers
Maximal independent sets and maximal matchings in series-parallel and related graph classes
Michael Drmota, Lander Ramos, Clément Requilé +1
The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that…
Enumeration of labelled 4-regular planar graphs
Marc Noy, Clément Requilé, Juanjo Rué
We present the first combinatorial scheme for counting labelled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential gen…
Proper colouring Painter-Builder game
Małgorzata Bednarska-Bzdęga, Michael Krivelevich, Viola Mészáros +1
We consider the following two-player game, parametrised by positive integers and . The game is played between Painter and Builder, alternately taking turns, with Painter mov…
Strong Ramsey Games: Drawing on an infinite board
Dan Hefetz, Christopher Kusch, Lothar Narins +3
We consider the strong Ramsey-type game , played on the edge set of the infinite complete -uniform hypergraph . Two p…
Variants of Plane Diameter Completion
Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos
The {\sc Plane Diameter Completion} problem asks, given a plane graph and a positive integer , if it is a spanning subgraph of a plane graph that has diameter at most $d…