| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A characterization of graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
|
Haynes, Teresa W.
|
|
|
358 |
C |
p. 457-467
|
artikel
|
| 2 |
A characterization of graphs with given total coalition numbers
|
Henning, Michael A.
|
|
|
358 |
C |
p. 395-403
|
artikel
|
| 3 |
A complete analysis of the convergence of C m ( D ) m = 1 ∞ for a multipartite tournament D
|
Jung, Ji-Hwan
|
|
|
358 |
C |
p. 344-357
|
artikel
|
| 4 |
Algorithmic study on 2-transitivity of graphs
|
Paul, Subhabrata
|
|
|
358 |
C |
p. 57-75
|
artikel
|
| 5 |
An improved upper bound for planar Turán number of double star S 2 , 5
|
Xu, Xin
|
|
|
358 |
C |
p. 326-332
|
artikel
|
| 6 |
Chromatic numbers for facet colouring of some generalised associahedra
|
Baralić, Dj.
|
|
|
358 |
C |
p. 272-284
|
artikel
|
| 7 |
Directed cycle k -connectivity of complete digraphs and complete regular bipartite digraphs
|
Wang, Chuchu
|
|
|
358 |
C |
p. 203-213
|
artikel
|
| 8 |
Editorial Board
|
|
|
|
358 |
C |
p. ii
|
artikel
|
| 9 |
Enumeration of spanning trees with a perfect matching of hexagonal lattices on the cylinder and Möbius strip
|
Li, Danyi
|
|
|
358 |
C |
p. 320-325
|
artikel
|
| 10 |
Forbidden pattern characterizations of 12-representable graphs defined by pattern-avoiding words
|
Takaoka, Asahi
|
|
|
358 |
C |
p. 285-301
|
artikel
|
| 11 |
Generating minimal redundant and maximal irredundant subhypergraphs
|
Boros, Endre
|
|
|
358 |
C |
p. 217-229
|
artikel
|
| 12 |
Graphs with degree sequence { ( m − 1 ) m , ( n − 1 ) n } and { m n , n m }
|
Brimkov, Boris
|
|
|
358 |
C |
p. 477-486
|
artikel
|
| 13 |
Improving the Caro–Wei bound and applications to Turán stability
|
Kelly, Tom
|
|
|
358 |
C |
p. 33-43
|
artikel
|
| 14 |
Integer orbits in rectangular lattice billiards
|
Dulio, Paolo
|
|
|
358 |
C |
p. 302-319
|
artikel
|
| 15 |
Integral trees with diameter 6
|
Xi, Fangxu
|
|
|
358 |
C |
p. 76-90
|
artikel
|
| 16 |
Maxima of the Q -index for 3 K 3 -free graphs
|
Zhang, Yanting
|
|
|
358 |
C |
p. 448-456
|
artikel
|
| 17 |
Minimum length word-representants of graph products
|
Srinivasan, Eshwar
|
|
|
358 |
C |
p. 91-104
|
artikel
|
| 18 |
Multithread interval scheduling with flexible machine availabilities: Complexity and efficient algorithms
|
Anapolska, Mariia
|
|
|
358 |
C |
p. 230-253
|
artikel
|
| 19 |
Mutual-visibility in strong products of graphs via total mutual-visibility
|
Cicerone, Serafino
|
|
|
358 |
C |
p. 136-146
|
artikel
|
| 20 |
Note on the eccentricity spectral radius of uniform hypertrees with given diameter
|
Tang, Zikai
|
|
|
358 |
C |
p. 214-216
|
artikel
|
| 21 |
On k -shifted antimagic spider forests
|
Chang, Fei-Huang
|
|
|
358 |
C |
p. 468-476
|
artikel
|
| 22 |
On locally identifying coloring of Cartesian product and tensor product of graphs
|
Bhyravarapu, Sriram
|
|
|
358 |
C |
p. 429-447
|
artikel
|
| 23 |
On locating and neighbor-locating colorings of sparse graphs
|
Chakraborty, Dipayan
|
|
|
358 |
C |
p. 366-381
|
artikel
|
| 24 |
On ( n , m ) -chromatic numbers of graphs with bounded sparsity parameters
|
Das, Sandip
|
|
|
358 |
C |
p. 417-428
|
artikel
|
| 25 |
On spectral radius of generalized arithmetic–geometric matrix of connected graphs and its applications
|
Chen, Xiaodan
|
|
|
358 |
C |
p. 1-12
|
artikel
|
| 26 |
On stable assignments generated by choice functions of mixed type
|
Karzanov, Alexander V.
|
|
|
358 |
C |
p. 112-135
|
artikel
|
| 27 |
On the rainbow planar Turán number of double stars
|
He, Shunhai
|
|
|
358 |
C |
p. 167-175
|
artikel
|
| 28 |
On the total version of the covering Italian domination problem
|
M., Alfred Raju
|
|
|
358 |
C |
p. 333-343
|
artikel
|
| 29 |
Pagoda functions for peg solitaire on graphs
|
Kreh, Martin
|
|
|
358 |
C |
p. 184-202
|
artikel
|
| 30 |
Perfect codes in m -Cayley hypergraphs
|
Wannatong, Kantapong
|
|
|
358 |
C |
p. 105-111
|
artikel
|
| 31 |
Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
|
Liu, Zhengjiao
|
|
|
358 |
C |
p. 158-166
|
artikel
|
| 32 |
Relaxation of Wegner’s planar graph conjecture for maximum degree 4
|
Cho, Eun-Kyung
|
|
|
358 |
C |
p. 254-261
|
artikel
|
| 33 |
Reliability analysis of exchanged hypercubes based on the path connectivity
|
Zhu, Wen-Han
|
|
|
358 |
C |
p. 404-416
|
artikel
|
| 34 |
Screw discrete dynamical systems and their applications to exact slow NIM
|
Gurvich, Vladimir
|
|
|
358 |
C |
p. 382-394
|
artikel
|
| 35 |
Selective dynamic compression
|
Klein, Shmuel T.
|
|
|
358 |
C |
p. 13-22
|
artikel
|
| 36 |
Some results on (strong) total proper connection number of some digraphs
|
Ma, Yingbin
|
|
|
358 |
C |
p. 44-56
|
artikel
|
| 37 |
Some results on vulnerability parameters and Wiener-type indices
|
Hua, Hongbo
|
|
|
358 |
C |
p. 262-271
|
artikel
|
| 38 |
Spanning connectivity of K 1 , r -free split graphs
|
Xiong, Wei
|
|
|
358 |
C |
p. 176-183
|
artikel
|
| 39 |
Spanning k -trees and distance signless Laplacian spectral radius of graphs
|
Zhou, Sizhong
|
|
|
358 |
C |
p. 358-365
|
artikel
|
| 40 |
Synchronizing dynamic Huffman codes
|
Klein, Shmuel T.
|
|
|
358 |
C |
p. 23-32
|
artikel
|
| 41 |
Two classes of 1-resilient semi-bent functions based on disjoint linear codes
|
Li, Luyang
|
|
|
358 |
C |
p. 147-157
|
artikel
|
Tijdschrift beschrijving