nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A characterization of perfect Roman trees
|
Sheikholeslami, S.M. |
|
|
285 |
C |
p. 501-508 |
artikel |
2 |
A combinatorial formula for the Schur coefficients of chromatic symmetric functions
|
Wang, David G.L. |
|
|
285 |
C |
p. 621-630 |
artikel |
3 |
A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
|
Hu, Xuewei |
|
|
285 |
C |
p. 407-422 |
artikel |
4 |
An algebraic expression of the number partitioning problem
|
Kubo, Susumu |
|
|
285 |
C |
p. 283-296 |
artikel |
5 |
An algorithm for delta–wye reduction of almost-planar graphs
|
Gitler, Isidoro |
|
|
285 |
C |
p. 631-641 |
artikel |
6 |
A note about online nonrepetitive coloring k -trees
|
Keszegh, Balázs |
|
|
285 |
C |
p. 108-112 |
artikel |
7 |
A note on 3-bisections in subcubic graphs
|
Cui, Qing |
|
|
285 |
C |
p. 147-152 |
artikel |
8 |
A note on the nonexistence of oracle-polynomial algorithms for robust combinatorial optimization
|
Buchheim, Christoph |
|
|
285 |
C |
p. 591-593 |
artikel |
9 |
A polyhedral study of the diameter constrained minimum spanning tree problem
|
Gouveia, Luis |
|
|
285 |
C |
p. 364-379 |
artikel |
10 |
A short note on the existence of infinite sequences of γ -graphs of graphs
|
Finbow, Stephen |
|
|
285 |
C |
p. 182-187 |
artikel |
11 |
Blocking zero forcing processes in Cartesian products of graphs
|
Karst, Nathaniel |
|
|
285 |
C |
p. 380-396 |
artikel |
12 |
Capacitated discrete unit disk cover
|
Mishra, Pawan K. |
|
|
285 |
C |
p. 242-251 |
artikel |
13 |
Comparative results and bounds for the eccentric-adjacency index
|
Hua, Hongbo |
|
|
285 |
C |
p. 188-196 |
artikel |
14 |
Cops that surround a robber
|
Burgess, Andrea C. |
|
|
285 |
C |
p. 552-566 |
artikel |
15 |
Deterministic construction of compressed sensing matrices from constant dimension codes
|
Wang, Gang |
|
|
285 |
C |
p. 9-17 |
artikel |
16 |
Distinguishing numbers and distinguishing indices of oriented graphs
|
Meslem, Kahina |
|
|
285 |
C |
p. 330-342 |
artikel |
17 |
Domination in direct products of complete graphs
|
Vemuri, Harish |
|
|
285 |
C |
p. 473-482 |
artikel |
18 |
Domination versus edge domination
|
Baste, Julien |
|
|
285 |
C |
p. 343-349 |
artikel |
19 |
Editorial Board
|
|
|
|
285 |
C |
p. ii |
artikel |
20 |
Equations enforcing repetitions under permutations
|
Day, Joel D. |
|
|
285 |
C |
p. 61-78 |
artikel |
21 |
Exact-2-relation graphs
|
Long, Yangjing |
|
|
285 |
C |
p. 212-226 |
artikel |
22 |
Forbidden rainbow subgraphs that force large monochromatic or multicolored k -connected subgraphs
|
Li, Xihe |
|
|
285 |
C |
p. 18-29 |
artikel |
23 |
Further analysis of bent functions from C and D which are provably outside or inside M #
|
Zhang, Fengrong |
|
|
285 |
C |
p. 458-472 |
artikel |
24 |
General upper bound on the game domination number
|
Bujtás, Csilla |
|
|
285 |
C |
p. 530-538 |
artikel |
25 |
Generating carbon nanotube caps of almost all chiralities, using six molecular segment types
|
Amsharov, Konstantin |
|
|
285 |
C |
p. 55-60 |
artikel |
26 |
Homomorphic extensions of CRT-based secret sharing
|
Ersoy, Oğuzhan |
|
|
285 |
C |
p. 317-329 |
artikel |
27 |
Independent distributions on a multi-branching AND–OR tree of height 2
|
Shigemizu, Mika |
|
|
285 |
C |
p. 274-282 |
artikel |
28 |
Intersection graph of maximal stars
|
Gomes, Guilherme de C.M. |
|
|
285 |
C |
p. 567-580 |
artikel |
29 |
k -Ary spanning trees contained in tournaments
|
Ai, Jiangdong |
|
|
285 |
C |
p. 141-146 |
artikel |
30 |
Kemeny’s constant for several families of graphs and real-world networks
|
Kooij, Robert E. |
|
|
285 |
C |
p. 96-107 |
artikel |
31 |
2-limited broadcast domination in subcubic graphs
|
Henning, Michael A. |
|
|
285 |
C |
p. 691-706 |
artikel |
32 |
Maximizing the strong triadic closure in split graphs and proper interval graphs
|
Konstantinidis, Athanasios L. |
|
|
285 |
C |
p. 79-95 |
artikel |
33 |
Min–max–min robustness for combinatorial problems with discrete budgeted uncertainty
|
Goerigk, Marc |
|
|
285 |
C |
p. 707-725 |
artikel |
34 |
Net Laplacian controllability for joins of signed graphs
|
Stanić, Zoran |
|
|
285 |
C |
p. 197-203 |
artikel |
35 |
Note on the bisection width of cubic graphs
|
Jobson, Adam S. |
|
|
285 |
C |
p. 434-442 |
artikel |
36 |
Null decomposition of unicyclic graphs
|
Allem, L. Emilio |
|
|
285 |
C |
p. 594-611 |
artikel |
37 |
On algorithmic complexity of double Roman domination
|
Poureidi, Abolfazl |
|
|
285 |
C |
p. 539-551 |
artikel |
38 |
On-line DP-coloring of graphs
|
Kim, Seog-Jin |
|
|
285 |
C |
p. 443-453 |
artikel |
39 |
On non-repetitive complexity of Arnoux–Rauzy words
|
Medková, Kateřina |
|
|
285 |
C |
p. 423-433 |
artikel |
40 |
On NP-hard graph properties characterized by the spectrum
|
Etesami, Omid |
|
|
285 |
C |
p. 526-529 |
artikel |
41 |
On rank and MDR cyclic and negacyclic codes of length p k over Z p m
|
Garg, Arpana |
|
|
285 |
C |
p. 581-590 |
artikel |
42 |
On the clique-width of ( 4 K 1 , C 4 , C 5 , C 7 ) -free graphs
|
Penev, Irena |
|
|
285 |
C |
p. 688-690 |
artikel |
43 |
On the extremal maximum agreement subtree problem
|
Markin, Alexey |
|
|
285 |
C |
p. 612-620 |
artikel |
44 |
On the extremal sizes of maximal graphs without ( k + 1 ) -connected subgraphs
|
Xu, Liqiong |
|
|
285 |
C |
p. 397-406 |
artikel |
45 |
On the independence number and the chromatic number of generalized preferential attachment models
|
Kovalenko, Kirill |
|
|
285 |
C |
p. 301-306 |
artikel |
46 |
On the k -Strong Roman Domination Problem
|
Liu, Zeyu |
|
|
285 |
C |
p. 227-241 |
artikel |
47 |
On the quotients between the eccentric connectivity index and the eccentric distance sum of graphs with diameter 2
|
Hua, Hongbo |
|
|
285 |
C |
p. 297-300 |
artikel |
48 |
Optimal online and offline algorithms for robot-assisted restoration of barrier coverage
|
Czyzowicz, J. |
|
|
285 |
C |
p. 650-662 |
artikel |
49 |
Partition games
|
Dailly, Antoine |
|
|
285 |
C |
p. 509-525 |
artikel |
50 |
Partitioning vertices into in- and out-dominating sets in digraphs
|
Nakamura, Kosuke |
|
|
285 |
C |
p. 43-54 |
artikel |
51 |
Perfect Italian domination on planar and regular graphs
|
Lauri, Juho |
|
|
285 |
C |
p. 676-687 |
artikel |
52 |
Proof of Stahl’s conjecture in some new cases
|
Osztényi, József |
|
|
285 |
C |
p. 113-118 |
artikel |
53 |
Ramsey and Gallai–Ramsey numbers for stars with extra independent edges
|
Mao, Yaping |
|
|
285 |
C |
p. 153-172 |
artikel |
54 |
R 3 -connectivity of folded hypercubes
|
Lee, Chia-Wei |
|
|
285 |
C |
p. 261-273 |
artikel |
55 |
Seymour’s second neighborhood conjecture for 5-anti-transitive oriented graphs
|
Daamouch, Moussa |
|
|
285 |
C |
p. 454-457 |
artikel |
56 |
Shrinking generators based on σ -LFSRs
|
Bishoi, Susil Kumar |
|
|
285 |
C |
p. 493-500 |
artikel |
57 |
S -packing chromatic vertex-critical graphs
|
Holub, Přemysl |
|
|
285 |
C |
p. 119-127 |
artikel |
58 |
Spectra of eccentricity matrices of graphs
|
Mahato, Iswar |
|
|
285 |
C |
p. 252-260 |
artikel |
59 |
Synchronizing sequences for road colored digraphs
|
Grech, Mariusz |
|
|
285 |
C |
p. 128-140 |
artikel |
60 |
The expected subtree number index in random polyphenylene and spiro chains
|
Yang, Yu |
|
|
285 |
C |
p. 483-492 |
artikel |
61 |
The fault tolerance of ( n , k ) -bubble-sort networks
|
Zhao, Shu-Li |
|
|
285 |
C |
p. 204-211 |
artikel |
62 |
The Graovac-Pisanski index of Sierpiński graphs
|
Fathalikhani, Khadijeh |
|
|
285 |
C |
p. 30-42 |
artikel |
63 |
The κ k -connectivity of line graphs
|
Li, Hengzhe |
|
|
285 |
C |
p. 1-8 |
artikel |
64 |
The maximum α -spectral radius and the majorization theorem of k -uniform supertrees
|
You, Lihua |
|
|
285 |
C |
p. 663-675 |
artikel |
65 |
The minimum second Zagreb eccentricity index of graphs with parameters
|
Hayat, Fazal |
|
|
285 |
C |
p. 307-316 |
artikel |
66 |
The Pfaffian property of Cayley graphs on dihedral groups
|
Lu, Fuliang |
|
|
285 |
C |
p. 642-649 |
artikel |
67 |
The undirected optical indices of complete m -ary trees
|
Lo, Yuan-Hsun |
|
|
285 |
C |
p. 173-181 |
artikel |
68 |
Unicyclic signed graphs with the first ⌊ n + 1 2 ⌋ largest energies
|
Zhu, Jianming |
|
|
285 |
C |
p. 350-363 |
artikel |