| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
ABC(T)-graphs: An axiomatic characterization of the median procedure in graphs with connected and G 2 -connected medians
|
Bénéteau, Laurine
|
|
|
359 |
C |
p. 55-74
|
artikel
|
| 2 |
About S -packing coloring of 3-irregular subcubic graphs
|
Mortada, Maidoun
|
|
|
359 |
C |
p. 16-18
|
artikel
|
| 3 |
Algorithm for partial sweep coverage on a line
|
Zhao, Lei
|
|
|
359 |
C |
p. 220-228
|
artikel
|
| 4 |
Algorithmic results for weak Roman domination problem in graphs
|
Paul, Kaustav
|
|
|
359 |
C |
p. 278-289
|
artikel
|
| 5 |
A note on Hamilton ℓ -cycle decomposition of complete k -partite hypergraphs
|
Jiang, Taijiang
|
|
|
359 |
C |
p. 214-219
|
artikel
|
| 6 |
Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
|
Jiang, Hongyi
|
|
|
359 |
C |
p. 383-399
|
artikel
|
| 7 |
A quick way to verify if a graph is 3-colorable
|
Cordero-Michel, Narda
|
|
|
359 |
C |
p. 176-185
|
artikel
|
| 8 |
Computational complexity of covering disconnected multigraphs
|
Bok, Jan
|
|
|
359 |
C |
p. 229-243
|
artikel
|
| 9 |
Diverse fair allocations: Complexity and algorithms
|
Mittal, Harshil
|
|
|
359 |
C |
p. 343-353
|
artikel
|
| 10 |
Dot product dimension of unicyclic graphs
|
Bahrami, Mahin
|
|
|
359 |
C |
p. 196-213
|
artikel
|
| 11 |
Eccentricity matrix of corona of two graphs
|
Pandey, Smrati
|
|
|
359 |
C |
p. 354-363
|
artikel
|
| 12 |
Editorial Board
|
|
|
|
359 |
C |
p. ii
|
artikel
|
| 13 |
Finding k -community structures in special graph classes
|
Baghirova, Narmina
|
|
|
359 |
C |
p. 159-175
|
artikel
|
| 14 |
Independence number and minimum degree for path-factor critical uniform graphs
|
Liu, Hongxia
|
|
|
359 |
C |
p. 153-158
|
artikel
|
| 15 |
Matchings in bipartite graphs with a given number of cuts
|
Liu, Jinfeng
|
|
|
359 |
C |
p. 303-309
|
artikel
|
| 16 |
Maximal induced matchings in K 4 -free and K 5 -free graphs
|
Basavaraju, Manu
|
|
|
359 |
C |
p. 407-418
|
artikel
|
| 17 |
On a conjecture of TxGraffiti: Relating zero forcing and vertex covers in graphs
|
Brimkov, Boris
|
|
|
359 |
C |
p. 290-302
|
artikel
|
| 18 |
On a family of universal cycles for multi-dimensional permutations
|
Kitaev, Sergey
|
|
|
359 |
C |
p. 310-320
|
artikel
|
| 19 |
On b-greedy colourings and z-colourings
|
Costa Ferreira da Silva, Jonas
|
|
|
359 |
C |
p. 250-268
|
artikel
|
| 20 |
On partitioning minimum spanning trees
|
Guttmann-Beck, Nili
|
|
|
359 |
C |
p. 45-54
|
artikel
|
| 21 |
On semi-transitivity of (extended) Mycielski graphs
|
Hameed, Humaira
|
|
|
359 |
C |
p. 83-88
|
artikel
|
| 22 |
On some classes of quasi-triangulated graphs
|
Eschen, Elaine M.
|
|
|
359 |
C |
p. 419-424
|
artikel
|
| 23 |
On the 2-spanning cyclability of honeycomb toroidal graphs
|
Alspach, Brian
|
|
|
359 |
C |
p. 1-9
|
artikel
|
| 24 |
Packing coloring of hypercubes with extended Hamming codes
|
Gregor, Petr
|
|
|
359 |
C |
p. 269-277
|
artikel
|
| 25 |
Polyhedral approach to weighted connected matchings in general graphs
|
Samer, Phillippe
|
|
|
359 |
C |
p. 143-152
|
artikel
|
| 26 |
Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
|
Ge, Jun
|
|
|
359 |
C |
p. 10-15
|
artikel
|
| 27 |
Spectra of total graphs
|
Bu, Tianyi
|
|
|
359 |
C |
p. 75-82
|
artikel
|
| 28 |
Squares of graphs are optimally ( s , t ) -supereulerian
|
Yan, Yue
|
|
|
359 |
C |
p. 331-342
|
artikel
|
| 29 |
Super graphs on groups, II
|
Arunkumar, G.
|
|
|
359 |
C |
p. 371-382
|
artikel
|
| 30 |
The matching polynomial of the path-tree of a complete graph
|
Guo, Mingxu
|
|
|
359 |
C |
p. 244-249
|
artikel
|
| 31 |
The proper 2-connection number of several graph classes
|
Brause, Christoph
|
|
|
359 |
C |
p. 34-44
|
artikel
|
| 32 |
There is no perfect Mondrian partition for squares of side lengths less than 1001
|
García-Colín, Natalia
|
|
|
359 |
C |
p. 400-406
|
artikel
|
| 33 |
The weighted Mostar index of cacti
|
Liu, Mengmeng
|
|
|
359 |
C |
p. 19-33
|
artikel
|
| 34 |
The weighted total cophenetic index: A novel balance index for phylogenetic networks
|
Knüver, Linda
|
|
|
359 |
C |
p. 89-142
|
artikel
|
| 35 |
The zero forcing number of claw-free cubic graphs
|
He, Mengya
|
|
|
359 |
C |
p. 321-330
|
artikel
|
| 36 |
Total colorings of complete multipartite graphs using amalgamations
|
Dalal, Aseem
|
|
|
359 |
C |
p. 186-195
|
artikel
|
| 37 |
Total-rainbow connection and forbidden subgraphs
|
Zhang, Jingshu
|
|
|
359 |
C |
p. 364-370
|
artikel
|
Tijdschrift beschrijving