nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on antimagic orientations of even regular graphs
|
Yang, Donglei |
|
2019 |
267 |
C |
p. 224-228 |
artikel |
2 |
Approximating maximum uniquely restricted matchings in bipartite graphs
|
Baste, Julien |
|
2019 |
267 |
C |
p. 30-40 |
artikel |
3 |
Characterization of color patterns by dynamic H -paths
|
Benítez-Bobadilla, Germán |
|
2019 |
267 |
C |
p. 41-51 |
artikel |
4 |
Classes of uniformly most reliable graphs for all-terminal reliability
|
Archer, Kassie |
|
2019 |
267 |
C |
p. 12-29 |
artikel |
5 |
Editorial Board
|
|
|
2019 |
267 |
C |
p. ii |
artikel |
6 |
Generalized Fitch graphs: Edge-labeled graphs that are explained by edge-labeled trees
|
Hellmuth, Marc |
|
2019 |
267 |
C |
p. 1-11 |
artikel |
7 |
H -colouring P t -free graphs in subexponential time
|
Groenland, Carla |
|
2019 |
267 |
C |
p. 184-189 |
artikel |
8 |
Improper sum-list colouring of 2-trees
|
Drgas-Burchardt, Ewa |
|
2019 |
267 |
C |
p. 73-84 |
artikel |
9 |
Interval orders with two interval lengths
|
Boyadzhiyska, Simona |
|
2019 |
267 |
C |
p. 52-63 |
artikel |
10 |
Isolation number of maximal outerplanar graphs
|
Tokunaga, Shin-ichi |
|
2019 |
267 |
C |
p. 215-218 |
artikel |
11 |
Light structures in 1-planar graphs with an application to linear 2-arboricity
|
Liu, Juan |
|
2019 |
267 |
C |
p. 120-130 |
artikel |
12 |
Nilpotent dynamics on signed interaction graphs and weak converses of Thomas’ rules
|
Richard, Adrien |
|
2019 |
267 |
C |
p. 160-175 |
artikel |
13 |
Nordhaus–Gaddum type inequalities for the two largest Laplacian eigenvalues
|
Grijó, Rodrigo |
|
2019 |
267 |
C |
p. 176-183 |
artikel |
14 |
On a Diagonal Conjecture for classical Ramsey numbers
|
Liang, Meilian |
|
2019 |
267 |
C |
p. 195-200 |
artikel |
15 |
On the chromatic number of random subgraphs of a certain distance graph
|
Pyaderkin, M.M. |
|
2019 |
267 |
C |
p. 209-214 |
artikel |
16 |
On the hydra number of disconnected graphs
|
Nicgorska-Miśkiewicz, Angelika |
|
2019 |
267 |
C |
p. 201-208 |
artikel |
17 |
On the polynomiality of finding K DMDGP re-orders
|
Lavor, Carlile |
|
2019 |
267 |
C |
p. 190-194 |
artikel |
18 |
On the skewness of Cartesian products with trees
|
Ouyang, Zhangdong |
|
2019 |
267 |
C |
p. 131-141 |
artikel |
19 |
Proof of a conjecture concerning maximum general sum-connectivity index χ α of graphs with given cyclomatic number when 1 < α < 2
|
Tomescu, Ioan |
|
2019 |
267 |
C |
p. 219-223 |
artikel |
20 |
Solving discrete logarithm problems faster with the aid of pre-computation
|
Hong, Jin |
|
2019 |
267 |
C |
p. 93-119 |
artikel |
21 |
Subnetwork reliability analysis in k -ary n -cubes
|
Feng, Kai |
|
2019 |
267 |
C |
p. 85-92 |
artikel |
22 |
Weakly connected Roman domination in graphs
|
Raczek, Joanna |
|
2019 |
267 |
C |
p. 151-159 |
artikel |
23 |
When Lagged Fibonacci Generators jump
|
Chetry, Moon K. |
|
2019 |
267 |
C |
p. 64-72 |
artikel |
24 |
X A E and X E A robustness of max–min matrices
|
Myšková, Helena |
|
2019 |
267 |
C |
p. 142-150 |
artikel |