|
On group choosability of graphs II.
|
# |
1392 - 12 |
|
Ramsey numbers of 3-uniform loose paths and loose cycles
|
# |
1392 - 10 |
|
On group choosability of total graphs
|
# |
1392 - 02 |
|
On the sum of signless Laplacian eigenvalues of a graph
|
# |
1391 - 12 |
|
Strongly walk-regular graphs
|
# |
1391 - 11 |
|
The Ramsey number of loose paths in 3-uniform hypergraphs
|
# |
1391 - 11 |
|
On the choice number of packings
|
# |
1391 - 04 |
|
A generalization of Ramsey theory for linear forests
|
# |
1391 - 04 |
|
Graphs whose normalized Laplacian has three eigenvalues
|
# |
1390 - 08 |
|
Universal adjacency matrices with two eigenvalues
|
# |
1390 - 08 |
|
On multicolor Ramsey number of paths versus cycles
|
# |
1389 - 01 |
|
A note on the Ramsey number of stars Complete graphs
|
# |
1389 - 01 |
|
A note on group choosability of graphs with girth at least 4
|
# |
1389 - 01 |
|
The characterization of graphs with the largest Laplacian eigenvalue at most (5 sqrt(13))/2
|
# |
1388 - 10 |
|
The spectral characterization of graphs of index less than 2 with no Zn as a component
|
# |
1388 - 10 |
|
3-Designs and Large Sets of PSL(2 2 n) with Block size 6
|
# |
1388 - 10 |
|
On integral graphs with few cycles
|
# |
1388 - 09 |
|
On a signless Laplacian spectral characterization of T-shape trees
|
# |
1388 - 07 |
|
Complex eigenvectors of network matrices give better insight into the community structure
|
# |
1388 - 07 |
|
On the nullity of bipartite graphs
|
# |
1388 - 02 |