5 citations · 12 across the 18 of their papers we have counts for
20 papers
Ramsey and Gallai-Ramsey numbers for linear forests and kipas
Ping Li, Yaping Mao, Ingo Schiermeyer +1
For two graphs , the \emph{Ramsey number} is the minimum integer such that any red/blue edge-coloring of contains either a red copy of or a blue copy of…
Loose edge-connection of graphs
Christoph Brause, Stanislav Jendrol, Ingo Schiermeyer
In the last years, connection concepts such as rainbow connection and proper connection appeared in graph theory and obtained a lot of attention. In this paper, we investigate the…
Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers
Meng Ji, Yaping Mao, Ingo Schiermeyer
A set of vertices in a simple graph is irredundant (CO-irredundant) if each vertex is either isolated in the induced subgraph or else has a…
Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
Christoph Brause, Trung Duy Doan, Přemysl Holub +4
For every graph , we consider the class of all connected -free graphs which are distinct from an odd cycle and have independence number at least , and we show…
Gallai-Ramsey number for the union of stars
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 the complete graph…
Homogeneous sets, clique-separators, critical graphs, and optimal -binding functions
Christoph Brause, Maximilian Geißer, Ingo Schiermeyer
Given a set of graphs, let be the optimal -binding function of the class of -free graph…