4 citations · 4 across the 3 of their papers we have counts for
4 papers
Ramsey and Gallai-Ramsey number for wheels
Yaping Mao, Zhao Wang, Colton Magnant +1
Given a graph and a positive integer , define the \emph{Gallai-Ramsey number} to be the minimum number of vertices such that any -edge coloring of contains eith…
Maximum independent sets near the upper bound
Ingo Schiermeyer
The size of a largest independent set of vertices in a given graph is denoted by and is called its independence number (or stability number). Given a graph and an in…
On star-wheel Ramsey numbers
Binlong Li, Ingo Schiermeyer
For two given graphs and , the Ramsey number is the least integer such that for every graph on vertices, either contains a or $\bar{G}…
Rainbow numbers for graphs with cyclomatic number at most two
Ingo Schiermeyer, Roman Sotak
For a given graph H and n ? 1; let f(n;H) denote the maximum number m for which it is possible to colour the edges of the complete graph Kn with m colours in such a way that each s…