3 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DS2023
Pattern detection in ordered graphs
Guillaume Ducoffe, Laurent Feuilloley, Michel Habib +1
A popular way to define or characterize graph classes is via forbidden subgraphs or forbidden minors. These characterizations play a key role in graph theory, but they rarely lead…
cs.DM2022
Hypergraphs with Polynomial Representation: Introducing -splits
François Pitois, Mohammed Haddad, Hamida Seba +1
Inspired by the split decomposition of graphs and rank-width, we introduce the notion of -splits. We focus on the family of -splits of a graph of order , and we prove that…
math.CO2020★ 3 cited
Two lower bounds for -centered colorings
Loïc Dubois, Gwenaël Joret, Guillem Perarnau +2
Given a graph and an integer , a coloring is \emph{-centered} if for every connected subgraph of , either uses more than colors o…