Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs
Sign Up to like & getrecommendations! Published in 2021 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-020-02248-8
Abstract: Given a graph G and a positive integer k , define the Gallai-Ramsey number to be the minimum number of vertices n such that any k -edge coloring of $$K_n$$ K n contains either a… read more here.
Keywords: classes unicyclic; unicyclic graphs; two classes; ramsey ... See more keywords