| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Adjoining to (K,s,t)-Wythoff’s game its P-generators as moves
|
Li, Haiyan
|
|
|
320 |
C |
p. 476-487
|
article
|
| 2 |
A family of bipartite circulant tournaments with acyclic disconnection 3
|
Goldfeder, Ilan A.
|
|
|
320 |
C |
p. 324-330
|
article
|
| 3 |
A faster algorithm for Cops and Robbers
|
Petr, Jan
|
|
|
320 |
C |
p. 11-14
|
article
|
| 4 |
Algorithmic techniques for finding resistance distances on structured graphs
|
Evans, E.J.
|
|
|
320 |
C |
p. 387-407
|
article
|
| 5 |
A linear-time algorithm for minimum k -hop dominating set of a cactus graph
|
Abu-Affash, A. Karim
|
|
|
320 |
C |
p. 488-499
|
article
|
| 6 |
An improved lower bound for the Seidel energy of trees
|
Einollahzadeh, M.
|
|
|
320 |
C |
p. 381-386
|
article
|
| 7 |
A note on geometric duality in matroid theory and knot theory
|
Traldi, Lorenzo
|
|
|
320 |
C |
p. 184-190
|
article
|
| 8 |
A type of generalized mesh-star transformation and applications in electrical networks
|
Cheng, Sujing
|
|
|
320 |
C |
p. 259-269
|
article
|
| 9 |
Bicritical graphs without removable edges
|
Zhang, Yipei
|
|
|
320 |
C |
p. 1-10
|
article
|
| 10 |
Bounds for the connected domination number of maximal outerplanar graphs
|
Chen, Shao-Liang
|
|
|
320 |
C |
p. 235-244
|
article
|
| 11 |
Catching an infinitely fast robber on a grid
|
Kinnersley, William B.
|
|
|
320 |
C |
p. 446-461
|
article
|
| 12 |
Colorings of oriented planar graphs avoiding a monochromatic subgraph
|
Bergold, Helena
|
|
|
320 |
C |
p. 81-94
|
article
|
| 13 |
Counting phylogenetic networks with few reticulation vertices: A second approach
|
Fuchs, Michael
|
|
|
320 |
C |
p. 140-149
|
article
|
| 14 |
Coverings of planar and three-dimensional sets with subsets of smaller diameter
|
Tolmachev, A.D.
|
|
|
320 |
C |
p. 270-281
|
article
|
| 15 |
Disjoint cycles in graphs with restricted independence number
|
Molla, Theodore
|
|
|
320 |
C |
p. 95-105
|
article
|
| 16 |
Edge metric dimension and mixed metric dimension of planar graph Q n
|
Qu, Jing
|
|
|
320 |
C |
p. 462-475
|
article
|
| 17 |
Editorial Board
|
|
|
|
320 |
C |
p. ii
|
article
|
| 18 |
Essential obstacles to Helly circular-arc graphs
|
Safe, Martín D.
|
|
|
320 |
C |
p. 245-258
|
article
|
| 19 |
Fair integral submodular flows
|
Frank, András
|
|
|
320 |
C |
p. 416-434
|
article
|
| 20 |
Forbidden triples generating a finite set of graphs with minimum degree three
|
Egawa, Yoshimi
|
|
|
320 |
C |
p. 282-295
|
article
|
| 21 |
Going Wide with the 1-2-3 Conjecture
|
Bensmail, Julien
|
|
|
320 |
C |
p. 15-32
|
article
|
| 22 |
Homogeneous sets, clique-separators, critical graphs, and optimal χ -binding functions
|
Brause, Christoph
|
|
|
320 |
C |
p. 211-222
|
article
|
| 23 |
Matrix representation of stability definitions in the graph model for conflict resolution with grey-based preferences
|
Wang, Dayong
|
|
|
320 |
C |
p. 106-125
|
article
|
| 24 |
Minimum degree conditions for the strength and bandwidth of graphs
|
Ichishima, Rikio
|
|
|
320 |
C |
p. 191-198
|
article
|
| 25 |
On extremal spectral results of digraphs based on sum distance
|
Xu, Leyou
|
|
|
320 |
C |
p. 47-67
|
article
|
| 26 |
On the algebraic immunity of direct sum constructions
|
Méaux, Pierrick
|
|
|
320 |
C |
p. 223-234
|
article
|
| 27 |
On the minimum Harary index of graphs with a given diameter or independence number
|
Borovićanin, Bojana
|
|
|
320 |
C |
p. 331-345
|
article
|
| 28 |
Optimal identifying codes of two families of Cayley graphs
|
Feng, Min
|
|
|
320 |
C |
p. 199-210
|
article
|
| 29 |
Positive matching decompositions of graphs
|
Farrokhi D.G., Mohammad
|
|
|
320 |
C |
p. 311-323
|
article
|
| 30 |
Reachability in arborescence packings
|
Hörsch, Florian
|
|
|
320 |
C |
p. 170-183
|
article
|
| 31 |
Sharp upper bounds on the Q -index of (minimally) 2-connected graphs with given size
|
Guo, Shu-Guang
|
|
|
320 |
C |
p. 408-415
|
article
|
| 32 |
Some novel minimax results for perfect matchings of hexagonal systems
|
Zhou, Xiangqian
|
|
|
320 |
C |
p. 435-445
|
article
|
| 33 |
Spanning tree enumeration and nearly triangular graph Laplacians
|
Go, Christian
|
|
|
320 |
C |
p. 356-369
|
article
|
| 34 |
Streaming algorithms for multitasking scheduling with shared processing
|
Fu, Bin
|
|
|
320 |
C |
p. 346-355
|
article
|
| 35 |
Strengthened Ore conditions for ( s , t ) -supereulerian graphs
|
Lei, Lan
|
|
|
320 |
C |
p. 68-80
|
article
|
| 36 |
The multi-returning secretary problem
|
Bayón, L.
|
|
|
320 |
C |
p. 33-46
|
article
|
| 37 |
The proper 2-connection number and size of graphs
|
Doan, Trung Duy
|
|
|
320 |
C |
p. 296-303
|
article
|
| 38 |
The read once formula of a series–parallel network
|
Mundici, Daniele
|
|
|
320 |
C |
p. 304-310
|
article
|
| 39 |
Truncated metric dimension for finite graphs
|
Frongillo, Rafael M.
|
|
|
320 |
C |
p. 150-169
|
article
|
| 40 |
Vertex and edge metric dimensions of cacti
|
Sedlar, Jelena
|
|
|
320 |
C |
p. 126-139
|
article
|
| 41 |
Well-hued graphs
|
Goddard, Wayne
|
|
|
320 |
C |
p. 370-380
|
article
|
Journal description