| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A general method to find the spectrum and eigenspaces of the k -token graph of a cycle, and 2-token through continuous fractions
|
Reyes, M.A.
|
|
|
360 |
C |
p. 353-365
|
artikel
|
| 2 |
An efficient algorithm for group testing with runlength constraints
|
Dalai, Marco
|
|
|
360 |
C |
p. 181-187
|
artikel
|
| 3 |
Approximation ratio of the min-degree greedy algorithm for Maximum Independent Set on interval and chordal graphs
|
Chaplick, Steven
|
|
|
360 |
C |
p. 275-281
|
artikel
|
| 4 |
Arbitrarily edge-partitionable graphs
|
Bensmail, Julien
|
|
|
360 |
C |
p. 428-442
|
artikel
|
| 5 |
A spectral condition for a graph to have strong parity factors
|
Zhou, Sizhong
|
|
|
360 |
C |
p. 188-195
|
artikel
|
| 6 |
Binding number, odd [ 1 , b ] -factors and the distance spectral radius
|
Hu, Yanling
|
|
|
360 |
C |
p. 406-413
|
artikel
|
| 7 |
Characterizations of graph classes via convex geometries: A survey
|
Dourado, Mitre C.
|
|
|
360 |
C |
p. 246-257
|
artikel
|
| 8 |
Dips at small sizes for topological graph obstruction sets
|
Kim, Hyoungjun
|
|
|
360 |
C |
p. 139-166
|
artikel
|
| 9 |
Editorial Board
|
|
|
|
360 |
C |
p. ii
|
artikel
|
| 10 |
Every 2-connected {claw, Z 2 }-free graph with minimum degree at least 4 contains two CISTs
|
Chen, Xiaodong
|
|
|
360 |
C |
p. 51-64
|
artikel
|
| 11 |
Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
|
Minato, Shin-ichi
|
|
|
360 |
C |
p. 467-486
|
artikel
|
| 12 |
Hamiltonian cycles avoiding prescribed arcs in semicomplete digraphs
|
Li, Ruijuan
|
|
|
360 |
C |
p. 451-458
|
artikel
|
| 13 |
Induced Turán problem in bipartite graphs
|
Axenovich, Maria
|
|
|
360 |
C |
p. 497-505
|
artikel
|
| 14 |
Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3
|
Wu, Yuehan
|
|
|
360 |
C |
p. 131-138
|
artikel
|
| 15 |
Maximum bisections of graphs without cycles of length four and five
|
Wu, Shufei
|
|
|
360 |
C |
p. 209-220
|
artikel
|
| 16 |
Minimum maximal acyclic matching in proper interval graphs
|
Chaudhary, Juhi
|
|
|
360 |
C |
p. 414-427
|
artikel
|
| 17 |
Monochromatic k -connection of graphs
|
Cai, Qingqiong
|
|
|
360 |
C |
p. 328-341
|
artikel
|
| 18 |
New results on edge-coloring and total-coloring of split graphs
|
Couto, Fernanda
|
|
|
360 |
C |
p. 297-306
|
artikel
|
| 19 |
Notes on Boolean read- k and multilinear circuits
|
Jukna, Stasys
|
|
|
360 |
C |
p. 307-327
|
artikel
|
| 20 |
On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
|
Gerbner, Dániel
|
|
|
360 |
C |
p. 459-466
|
artikel
|
| 21 |
On injective edge-coloring of graphs with maximum degree 4
|
Fu, Jiacong
|
|
|
360 |
C |
p. 119-130
|
artikel
|
| 22 |
On interval colouring reorientation number of oriented graphs
|
Borowiecka-Olszewska, Marta
|
|
|
360 |
C |
p. 65-80
|
artikel
|
| 23 |
On locally finite ordered rooted trees and their rooted subtrees
|
Agnarsson, Geir
|
|
|
360 |
C |
p. 1-21
|
artikel
|
| 24 |
On nonrepetitive colorings of paths and cycles
|
Botler, Fábio
|
|
|
360 |
C |
p. 221-228
|
artikel
|
| 25 |
On the A α -index of graphs with given order and dissociation number
|
Zhou, Zihan
|
|
|
360 |
C |
p. 167-180
|
artikel
|
| 26 |
On the chromatic number of powers of subdivisions of graphs
|
Anastos, Michael
|
|
|
360 |
C |
p. 506-511
|
artikel
|
| 27 |
On the eccentric connectivity index of trees with given domination number
|
Zhou, Ting
|
|
|
360 |
C |
p. 512-519
|
artikel
|
| 28 |
On two open problems on the normality of bent functions
|
Polujan, Alexandr
|
|
|
360 |
C |
p. 115-118
|
artikel
|
| 29 |
Polynomial delay hybrid algorithms to enumerate candidate keys for a relation
|
Ennaoui, Karima
|
|
|
360 |
C |
p. 443-450
|
artikel
|
| 30 |
Recognizing unit multiple interval graphs is hard
|
Ardévol Martínez, Virginia
|
|
|
360 |
C |
p. 258-274
|
artikel
|
| 31 |
Re-1-embeddings of optimal 1-embedded graphs on the projective plane
|
Suzuki, Yusuke
|
|
|
360 |
C |
p. 487-496
|
artikel
|
| 32 |
Semi-proper interval graphs
|
Scheffler, Robert
|
|
|
360 |
C |
p. 22-41
|
artikel
|
| 33 |
Sequence saturation
|
Anand,
|
|
|
360 |
C |
p. 382-393
|
artikel
|
| 34 |
Shapley–Folkman-type theorem for integrally convex sets
|
Murota, Kazuo
|
|
|
360 |
C |
p. 42-50
|
artikel
|
| 35 |
Some new results on bar visibility of digraphs
|
Feng, Yuanrui
|
|
|
360 |
C |
p. 342-352
|
artikel
|
| 36 |
Some results on { K 2 , C 2 i + 1 : i ≥ 1 } -factor in a graph
|
Lv, Xiaoyun
|
|
|
360 |
C |
p. 81-92
|
artikel
|
| 37 |
Study on geometric–arithmetic, arithmetic–geometric and Randić indices of graphs
|
Das, Kinkar Chandra
|
|
|
360 |
C |
p. 229-245
|
artikel
|
| 38 |
The generalized 4-connectivity of burnt pancake graphs
|
Wang, Jing
|
|
|
360 |
C |
p. 93-114
|
artikel
|
| 39 |
The splitting power of branching programs of bounded repetition and CNFs of bounded width
|
Razgon, Igor
|
|
|
360 |
C |
p. 366-381
|
artikel
|
| 40 |
Time-delayed Cops and Robbers
|
Clarke, Nancy E.
|
|
|
360 |
C |
p. 394-405
|
artikel
|
| 41 |
Two-disjoint-cycle-cover edge/vertex bipancyclicity of star graphs
|
Xue, Shudan
|
|
|
360 |
C |
p. 196-208
|
artikel
|
| 42 |
Unraveling the enigmatic irregular coloring of Honeycomb Networks
|
S., Shyama
|
|
|
360 |
C |
p. 282-296
|
artikel
|
Tijdschrift beschrijving