23 citations · 67 across the 24 of their papers we have counts for
3 papers · 1 filter
All partitions have small parts - Gallai-Ramsey numbers of bipartite graphs
Haibo Wu, Colton Magnant, Pouria Salehi Nowbandegani +1
Gallai-colorings are edge-colored complete graphs in which there are no rainbow triangles. Within such colored complete graphs, we consider Ramsey-type questions, looking for speci…
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
Wenjing Li, Xueliang Li, Colton Magnant +1
A graph is said to be \emph{total-colored} if all the edges and the vertices of the graph are colored. A total-colored graph is \emph{total-rainbow connected} if any two vertices o…
Total rainbow connection of digraphs
Hui Lei, Henry Liu, Colton Magnant +1
An edge-coloured path is rainbow if its edges have distinct colours. For a connected graph , the rainbow connection number (resp. strong rainbow connection number) of is the…