Antimagic labelling is a fascinating area of graph theory that assigns unique integers ... and Ringel—which posits that every simple connected graph other than K₂ is antimagic—has spurred ...

Graph crossing numbers quantify the minimum number of edge intersections in any planar drawing of a graph, an essential parameter in both theoretical and applied graph theory. The study of ...