We develop an improved bound for the chromatic number of graphs of maximum degree Δ
under the assumption that the number of edges spanning any neighbourhood is at most for …

This thesis deals with problems in what one can call extremal combinatorics, focused on
graph theory. Extremal graph theory mostly refers to a more specific subfield, which we will …

Squared Chromatic Number Without Claws or Large Cliques Page 1 http://dx.doi.org/. /CMB--
©Canadian Mathematical Society Squared Chromatic Number Without Claws or Large …

We wish to bring attention to a natural but slightly hidden problem, posed by Erdös and
Nešetřil in the late 1980s, an edge version of the degree--diameter problem. Our main …

We investigate the effect of a fixed forbidden clique minor upon the strong chromatic index,
both in multigraphs and in simple graphs. We conjecture for each k≥ 4 that any K k‐minor …

We wish to bring attention to a natural but slightly hidden problem, posed by Erdos and
Neˇsetˇril in the late 1980s, an edge version of the degree–diameter problem. Our main …

Strong chromatic index and Hadwiger number Page 1 Received: 16 June 2019 | Accepted: 8
December 2021 DOI: 10.1002/jgt.22788 ARTICLE Strong chromatic index and Hadwiger number …

We show that the strong chromatic index of unit disk graphs is efficiently 6-approximable.
This improves on 8-approximability as shown by Barrett, Istrate, Kumar, Marathe, Thite, and …