7 citations · 8 across the 6 of their papers we have counts for
6 papers
On the size of special class 1 graphs and -co-critical graphs
Gang Chen, Zhengke Miao, Zi-Xia Song +1
A well-known theorem of Vizing states that if is a simple graph with maximum degree , then the chromatic index of is or . A graph is class 1 if $χ'(…
On the size of -co-critical graphs
Zi-Xia Song, Jingmei Zhang
Given an integer and graphs , we write if every -coloring of the edges of contains a monochromatic copy o…
Gallai-Ramsey numbers of and
Hui Lei, Yongtang Shi, Zi-Xia Song +1
A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai -coloring is a Gallai coloring that uses colors. Given an integer $k…
Improved Upper Bounds for Gallai-Ramsey Numbers of Odd Cycles
Christian Bosse, Zi-Xia Song, Jingmei Zhang
A Gallai coloring of a complete graph is an edge-coloring such that no triangle has all its edges colored differently. A Gallai -coloring is a Gallai coloring that uses colo…
A conjecture on Gallai-Ramsey numbers of even cycles and paths
Zi-Xia Song, Jingmei Zhang
A Gallai coloring is a coloring of the edges of a complete graph without rainbow triangles, and a Gallai -coloring is a Gallai coloring that uses at most colors. Given an in…
Spectral Bounds for the Connectivity of Regular Graphs with Given Order
Aida Abiad, Boris Brimkov, Xavier Martinez-Rivera +2
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilie…