| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
All partitions have small parts — Gallai–Ramsey numbers of bipartite graphs
|
Wu, Haibo
|
|
2019
|
254 |
C |
p. 196-203
|
article
|
| 2 |
A new lower bound on the double domination number of a graph
|
Hajian, Majid
|
|
2019
|
254 |
C |
p. 280-282
|
article
|
| 3 |
An interleaved method for constructing de Bruijn sequences
|
Zhao, Xiao-Xin
|
|
2019
|
254 |
C |
p. 234-245
|
article
|
| 4 |
An O ( n 2 ) time algorithm for the minimal permutation completion problem
|
Crespelle, Christophe
|
|
2019
|
254 |
C |
p. 80-95
|
article
|
| 5 |
A note on the localization number of random graphs: Diameter two case
|
Dudek, Andrzej
|
|
2019
|
254 |
C |
p. 107-112
|
article
|
| 6 |
Bipartite Ramsey numbers of paths for random graphs
|
Liu, Meng
|
|
2019
|
254 |
C |
p. 171-174
|
article
|
| 7 |
Computational complexity aspects of point visibility graphs
|
Himmel, Anne-Sophie
|
|
2019
|
254 |
C |
p. 283-290
|
article
|
| 8 |
Editorial Board
|
|
|
2019
|
254 |
C |
p. ii
|
article
|
| 9 |
Extremal graphs of given parameters with respect to the eccentricity distance sum and the eccentric connectivity index
|
Zhang, Huihui
|
|
2019
|
254 |
C |
p. 204-221
|
article
|
| 10 |
Fault tolerant supergraphs with automorphisms
|
Ganesan, Ashwin
|
|
2019
|
254 |
C |
p. 274-279
|
article
|
| 11 |
Graphs with small fall-spectrum
|
Silva, Ana
|
|
2019
|
254 |
C |
p. 183-188
|
article
|
| 12 |
Identifying codes in the direct product of a complete graph and some special graphs
|
Lu, Mei
|
|
2019
|
254 |
C |
p. 175-182
|
article
|
| 13 |
Inertia and distance energy of line graphs of unicyclic graphs
|
Zhang, Xiaoling
|
|
2019
|
254 |
C |
p. 222-233
|
article
|
| 14 |
Large induced forests in planar graphs with girth 4
|
Dross, François
|
|
2019
|
254 |
C |
p. 96-106
|
article
|
| 15 |
Locating battery charging stations to facilitate almost shortest paths
|
Arkin, Esther M.
|
|
2019
|
254 |
C |
p. 10-16
|
article
|
| 16 |
Majority problems of large query size
|
Gerbner, Dániel
|
|
2019
|
254 |
C |
p. 124-134
|
article
|
| 17 |
On the geometric–arithmetic index of a graph
|
Chen, Yin
|
|
2019
|
254 |
C |
p. 268-273
|
article
|
| 18 |
On the minimal matching energies of unicyclic graphs
|
Zhu, Jianming
|
|
2019
|
254 |
C |
p. 246-255
|
article
|
| 19 |
On the number of points with pairwise integral distances on a circle
|
Bat-Ochir, Ganbileg
|
|
2019
|
254 |
C |
p. 17-32
|
article
|
| 20 |
On the random version of the Erdős matching conjecture
|
Alishahi, Meysam
|
|
2019
|
254 |
C |
p. 1-9
|
article
|
| 21 |
On the semitotal domination number of line graphs
|
Zhu, Enqiang
|
|
2019
|
254 |
C |
p. 295-298
|
article
|
| 22 |
On the signless Laplacian Estrada index of cacti
|
Wang, Kun
|
|
2019
|
254 |
C |
p. 189-195
|
article
|
| 23 |
On the uniqueness of some girth eight algebraically defined graphs, Part II
|
Kronenthal, Brian G.
|
|
2019
|
254 |
C |
p. 161-170
|
article
|
| 24 |
On two-sided Max-Linear equations
|
Jones, Daniel
|
|
2019
|
254 |
C |
p. 146-160
|
article
|
| 25 |
Optimal non-projective linear codes constructed from down-sets
|
Hyun, Jong Yoon
|
|
2019
|
254 |
C |
p. 135-145
|
article
|
| 26 |
The existence of f -forests and f -trees in graphs
|
Furuya, Michitaka
|
|
2019
|
254 |
C |
p. 113-123
|
article
|
| 27 |
The flip Markov chain for connected regular graphs
|
Cooper, Colin
|
|
2019
|
254 |
C |
p. 56-79
|
article
|
| 28 |
The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
|
Zhu, Zhongxun
|
|
2019
|
254 |
C |
p. 256-267
|
article
|
| 29 |
The partial order competition dimensions of bipartite graphs
|
Choi, Jihoon
|
|
2019
|
254 |
C |
p. 47-55
|
article
|
| 30 |
The Turán number for spanning linear forests
|
Wang, Jian
|
|
2019
|
254 |
C |
p. 291-294
|
article
|
| 31 |
Throttling positive semidefinite zero forcing propagation time on graphs
|
Carlson, Joshua
|
|
2019
|
254 |
C |
p. 33-46
|
article
|
Journal description