97 citations
- Centre National de la Recherche ScientifiqueFR37 papers
- Lyon 1 UniversitéFR21 papers
- Georges Friedel LaboratoryFR16 papers
- InsermFR15 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR11 papers
- Centrale Lyon ENISEFR8 papers
- Université Clermont AuvergneFR8 papers
- Université Jean MonnetFR7 papers
- Biologie, ingénierie et imagerie pour l'OphtalmologieFR6 papers
- Centre Hospitalier Universitaire de Saint-ÉtienneFR4 papers
- École Centrale de LyonFR4 papers
- European Organization for Nuclear ResearchCH4 papers
4 papers · 1 filter
Distance-based (and path-based) covering problems for graphs of given cyclomatic number
Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen
We study a large family of graph covering problems, whose definitions rely on distances, for graphs of bounded cyclomatic number (that is, the minimum number of edges that need to…
Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
Sandip Das, Florent Foucaud, Sk Samim Islam +1
For a graph with a vertex set and an edge set , a function is called a \emph{broadcast} on . For e…
List homomorphisms to separable signed graphs
Jan Bok, Richard Brewster, Tomás Feder +2
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and refle…
The RED-BLUE SEPARATION problem on graphs
Subhadeep Ranjan Dev, Sanjana Dey, Florent Foucaud +2
We introduce the Red-Blue Separation problem on graphs, where we are given a graph whose vertices are colored either red or blue, and we want to select a (small) subset $…