no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A class of functions with low-valued Walsh spectrum
|
Li, Fengwei |
|
|
279 |
C |
p. 92-105 |
article |
2 |
A class of spectral bounds for Max
k
-Cut
|
Anjos, Miguel F. |
|
|
279 |
C |
p. 12-24 |
article |
3 |
A de Bruijn–Erdös Theorem for
(
q
,
q
−
4
)
-graphs
|
Schrader, Rainer |
|
|
279 |
C |
p. 198-201 |
article |
4 |
A Hamilton sufficient condition for completely independent spanning tree
|
Hong, Xia |
|
|
279 |
C |
p. 183-187 |
article |
5 |
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
|
Gu, Mei-Mei |
|
|
279 |
C |
p. 80-91 |
article |
6 |
A sharp Ore-type condition for a connected graph with no induced star to have a Hamiltonian path
|
Choi, Ilkyoo |
|
|
279 |
C |
p. 178-182 |
article |
7 |
Construction of weightwise perfectly balanced Boolean functions with high weightwise nonlinearity
|
Li, Jingjing |
|
|
279 |
C |
p. 218-227 |
article |
8 |
Distance restricted optimal pebbling in cycles
|
Shiue, Chin-Lin |
|
|
279 |
C |
p. 125-133 |
article |
9 |
Editorial Board
|
|
|
|
279 |
C |
p. ii |
article |
10 |
Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles
|
Sun, Lin |
|
|
279 |
C |
p. 146-153 |
article |
11 |
Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions
|
Song, Chao |
|
|
279 |
C |
p. 202-209 |
article |
12 |
On approximability of minimum color-spanning ball in high dimensions
|
Kazemi, Mohammad Reza |
|
|
279 |
C |
p. 188-191 |
article |
13 |
On non-repetitive sequences of arithmetic progressions: The cases
k
∈
{
4
,
5
,
6
,
7
,
8
}
|
Lužar, Borut |
|
|
279 |
C |
p. 106-117 |
article |
14 |
On
q
-nearly bent Boolean functions
|
Chen, Zhixiong |
|
|
279 |
C |
p. 210-217 |
article |
15 |
On the conjecture of bijection between perfect matching and sub-hypercube in folded hypercubes
|
Lü, Huazhong |
|
|
279 |
C |
p. 192-194 |
article |
16 |
On the WalkerMaker–WalkerBreaker games
|
Forcan, Jovana |
|
|
279 |
C |
p. 69-79 |
article |
17 |
Partitions of graphs and multigraphs under degree constraints
|
Song, Jialei |
|
|
279 |
C |
p. 134-145 |
article |
18 |
Permutation patterns in genome rearrangement problems: The reversal model
|
Cerbai, Giulio |
|
|
279 |
C |
p. 34-48 |
article |
19 |
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3
|
Noguchi, Kenta |
|
|
279 |
C |
p. 195-197 |
article |
20 |
Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
|
Takaoka, Asahi |
|
|
279 |
C |
p. 154-167 |
article |
21 |
Sorting with forbidden intermediates
|
Comin, Carlo |
|
|
279 |
C |
p. 49-68 |
article |
22 |
Spectral properties of the eccentricity matrix of graphs
|
Wang, Jianfeng |
|
|
279 |
C |
p. 168-177 |
article |
23 |
The number of switching isomorphism classes of signed graphs associated with particular graphs
|
Bagheri, Y. |
|
|
279 |
C |
p. 25-33 |
article |
24 |
The second largest eigenvalue and vertex-connectivity of regular multigraphs
|
O, Suil |
|
|
279 |
C |
p. 118-124 |
article |
25 |
Treewidth and gonality of glued grid graphs
|
Aidun, Ivan |
|
|
279 |
C |
p. 1-11 |
article |