Antimagic labelling is a fascinating area of graph theory that assigns unique integers to the edges of a graph in such a way that the resulting vertex sums are distinct. This concept, grounded in the ...

The Erdős–Pósa property forms a pivotal concept in modern graph theory by establishing a profound duality between the problems of packing and covering cycles or other substructures. At its core, this ...

One of the highlights in the Robertson-Seymour theory on graph minors is the finiteness (for each fixed surface S) of the set of the minimal forbidden minors for S. Theorem 7.0.1 (Robertson and ...