1 citations · 2 across the 13 of their papers we have counts for
26 papers · 1 filter
Clustered Colouring of Odd--Minor-Free Graphs
Robert Hickingbotham, Dong Yeap Kang, Sang-il Oum +2
The clustered chromatic number of a graph class is the minimum integer such that every graph has a -colouring where each monochromatic compon…
Finding dense minors using average degree
Kevin Hendrey, Sergey Norin, Raphael Steiner +1
Motivated by Hadwiger's conjecture, we study the problem of finding the densest possible -vertex minor in graphs of average degree at least . We show that if has averag…
Size-Ramsey numbers of structurally sparse graphs
Nemanja Draganić, Marc Kaufmann, David Munhá Correia +2
Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erdős, Faudree, Rousseau and Schelp in 1978. Research has mainly…
Subdigraphs of prescribed size and outdegree
Raphael Steiner
In 2006, Noga Alon raised the following open problem: Does there exist an absolute constant such that every -vertex digraph with minimum out-degree at least contains…
Coloring circle arrangements: New -chromatic planar graphs
Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher +3
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most . Motivated by this conjecture, we…
Cycle lengths modulo in expanders
Anders Martinsson, Raphael Steiner
Given a constant , an -vertex graph is called an -expander if every set of at most vertices in has an external neighborhood of size at least . Addres…