|
On three-color Ramsey number of paths
|
# |
|
|
Decomposing hypergraphs into k -colorable hypergraphs
|
# |
|
|
On group choosability of graphs II.
|
# |
|
|
Ramsey numbers of 3-uniform loose paths and loose cycles
|
# |
|
|
On group choosability of total graphs
|
# |
|
|
On the sum of signless Laplacian eigenvalues of a graph
|
# |
|
|
Strongly walk-regular graphs
|
# |
|
|
The Ramsey number of loose paths in 3-uniform hypergraphs
|
# |
|
|
On the choice number of packings
|
# |
|
|
A generalization of Ramsey theory for linear forests
|
# |
|
|
Universal adjacency matrices with two eigenvalues
|
# |
|
|
Graphs whose normalized Laplacian has three eigenvalues
|
# |
|
|
On multicolor Ramsey number of paths versus cycles
|
# |
|
|
A note on the Ramsey number of stars Complete graphs
|
# |
|
|
A note on group choosability of graphs with girth at least 4
|
# |
|
|
The spectral characterization of graphs of index less than 2 with no Zn as a component
|
# |
|
|
3-Designs and Large Sets of PSL(2 2 n) with Block size 6
|
# |
|
|
The characterization of graphs with the largest Laplacian eigenvalue at most (5 sqrt(13))/2
|
# |
|
|
On integral graphs with few cycles
|
# |
|
|
On a signless Laplacian spectral characterization of T-shape trees
|
# |
|