Carpathian Journal of Mathematics, Vol. 39, No. 2 (2023), pp. 371-382 (12 pages) The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the plane. In ...

Abstract The adjacent vertex-distinguishing total chromatic number of a graph 𝐺, denoted by χ𝑎𝑡(𝐺), is the smallest denoted by 𝑘 for which 𝐺 has a proper total 𝑘-coloring such that any two ...

A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections. “It’s a bit of a surprise, at least for me, that such a combination ...

It has been an exhilarating year in combinatorics research. In early 2023, mathematicians were stunned when two of the biggest problems in the field were solved in as many months. Now, a third major ...

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 ...