1 citations · 1 across the 1 of their papers we have counts for
5 papers
Gallai-Ramsey numbers involving a rainbow -path
Jinyu Zou, Zhao Wang, Hong-Jian Lai +1
Given two non-empty graphs and a positive integer , the Gallai-Ramsey number is defined as the minimum integer such that for all ,…
Fractional matching preclusion number of graphs
Jinyu Zou, Yaping Mao, Zhao Wang +1
The \emph{fractional matching preclusion number} of a graph , denoted by , is the minimum number of edges whose deletion results in a graph that has no fractional perfec…
Ramsey and Gallai-Ramsey numbers for two classes of unicyclic graphs
Zhao Wang, Yaping Mao, 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…
Matching preclusion number of graphs
Zhao Wang, Yaping Mao, Eddie Cheng +1
The \emph{matching preclusion number} of a graph , denoted by $\mpo(G)$, is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor…
Gallai-Ramsey numbers for books
Jinyu Zou, Yaping Mao, Colton Magnant +2
Given a graph and a positive integer , the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices such that any -edge coloring of contains…