5 citations · 15 across the 7 of their papers we have counts for
8 papers
When all holes have the same length
Jake Horsfield, Myriam Preissmann, Cléophée Robin +3
For every integer , we give a structural description of the class of graphs whose chordless cycles of length at least 4 all have length .
Graphs with all holes the same length
Linda Cook, Jake Horsfield, Myriam Preissmann +5
A graph is "-holed" if all its induced cycles of length at least four have length exactly . We give a complete description of the -holed graphs for each $\ell\ge…
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…
Exact values for three domination-like problems in circular and infinite grid graphs of small height
Marwane Bouznif, Julien Darlay, Julien Moncel +1
In this paper we study three domination-like problems, namely identifying codes, locating-dominating codes, and locating-total-dominating codes. We are interested in finding the mi…
On more variants of the Majority Problem
Paul-Elliot Anglès d'Auriac, Francis Maisonneuve, Vivien Maisonneuve +2
The problem we are considering is the following. A colorblind player is given a set of colored balls. He knows that each ball is colored either red or…
Characterizing path graphs by forbidden induced subgraphs
Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs.…