6 citations · 6 across the 6 of their papers we have counts for
8 papers
A program to find families of graphs in Free with bounded clique width
Cléophée Robin, Alexandre Talon
In this paper we study the class of graphs without cycles of size 4 and independent sets of size 4 as induced subgraphs: . This is one of the three mini…
Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
Fabrício Siqueira Benevides, Arthur Lima Quintino, Alexandre Talon
Given an -edge-colouring of the edges of a graph , we say that it can be partitioned into monochromatic cycles when there exists a set of vertex-disjoint monochromati…
Partitioning into degenerate graphs in linear time
Timothée Corsini, Quentin Deschamps, Carl Feghali +3
Let be a connected graph with maximum degree distinct from . Generalizing Brooks' Theorem, Borodin, Kostochka and Toft proved that if are…
Intensive use of computing resources for dominations in grids and other combinatorial problems
Alexandre Talon
Our goal is to prove new results in graph theory and combinatorics thanks to the speed of computers, used with smart algorithms. We tackle four problems. The four-colour theorem st…
Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach
Silvère Gangloff, Alexandre Talon
In this text, we prove the existence of an asymptotic growth rate of the number of dominating sets (and variants) on finite rectangular grids, when the dimensions of the grid grow…
The 2-domination and Roman domination numbers of grid graphs
Michaël Rao, Alexandre Talon
We investigate the 2-domination number for grid graphs, that is the size of a smallest set of vertices of the grid such that each vertex of the grid belongs to or has at le…