3 citations · 6 across the 7 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2026
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…
cs.DM2024
Coloring bridge-free antiprismatic graphs
Cléophée Robin, Eileen Robinson
The coloring problem is a well-research topic and its complexity is known for several classes of graphs. However, the question of its complexity remains open for the class of antip…
cs.DM2019★ 1 cited
On the complexity of colouring antiprismatic graphs
Myriam Preissmann, Cléophée Robin, Nicolas Trotignon
A graph G is prismatic if for every triangle T of G, every vertex of G not in T has a unique neighbour in T. The complement of a prismatic graph is called \emph{antiprismatic}. The…