Jasmina Ferme, Daša Štesl, On Distance Dominator Packing Coloring in Graphs, Filomat, Vol. 35, No. 12 (2021), pp. 4005-4016 ...

The study of graph colouring has long been a central topic in discrete mathematics, with a prominent focus on optimising the assignment of labels or colours to vertices such that adjacent vertices ...

Long monochromatic paths in random graphs presented by Andrzej Dudek, Ph.D., Department of Mathematics, Western Michigan University Abstract: Recall that the size-Ramsey number of F, r^ (F, r), is the ...

graph-coloring: given a graph, the a coloring of the graph means assigning each of its vertices a color such that no pair of vertices connected by an edge have the same color in general, this is a ...

Bhaswar B. Bhattacharya, COLLISION TIMES IN MULTICOLOR URN MODELS AND SEQUENTIAL GRAPH COLORING WITH APPLICATIONS TO DISCRETE LOGARITHMS, The Annals of Applied Probability, Vol. 26, No. 6 (December ...

But since the 1960s, mathematicians have escaped these coloring frustrations by working with so-called perfect graphs, which “behave very nicely with respect to coloring,” said Chudnovsky, a ...

Perfect graphs are, by definition, colorable with the most limited palette possible. When coloring a graph, every node in a mutually connected cluster, or “clique,” must receive a distinct ...