Serge Gaspers

activity

20062021

most citedOnline Fair Division: analysing a Food Bank problem

66 citations · 206 across the 36 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

2 papers · 2 filters

math.CO2018

$(2 P_{2}, K_{4})$ -Free Graphs are 4-Colorable

Serge Gaspers, Shenwei Huang

In this paper, we show that every $(2 P_{2}, K_{4})$ -free graph is 4-colorable. The bound is attained by the five-wheel and the complement of the seven-cycle. This answers an open questi…

math.CO2018

Colouring Square-Free Graphs without Long Induced Paths

Serge Gaspers, Shenwei Huang, Daniël Paulusma

The complexity of {\sc Colouring} is fully understood for $H$ -free graphs, but there are still major complexity gaps if two induced subgraphs $H_{1}$ and $H_{2}$ are forbidden. Let $H_…

(2P2​,K4​)-Free Graphs are 4-Colorable

Colouring Square-Free Graphs without Long Induced Paths

$(2 P_{2}, K_{4})$ -Free Graphs are 4-Colorable