| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
|
Curcio, Brian
|
|
|
371 |
C |
p. 80-98
|
artikel
|
| 2 |
A simplified graph parameter and its relationship to the modified Randić index
|
Lin, Dazhi
|
|
|
371 |
C |
p. 60-64
|
artikel
|
| 3 |
Bicrucial k -power-free permutations
|
Akhmejanova, Margarita
|
|
|
371 |
C |
p. 232-239
|
artikel
|
| 4 |
Bounds on Graceful k -colorings of graphs
|
Pantoja, Paola T.
|
|
|
371 |
C |
p. 218-231
|
artikel
|
| 5 |
Bounds on the A α -spectral radius of uniform hypergraphs with some vertices deleted
|
Zhang, Peng-Li
|
|
|
371 |
C |
p. 1-16
|
artikel
|
| 6 |
Cluster Editing with Vertex Splitting
|
Abu-Khzam, Faisal N.
|
|
|
371 |
C |
p. 185-195
|
artikel
|
| 7 |
Corrigendum to “On maximum graphs in Tutte polynomial posets” [Discrete Appl. Math. 339 (2023) 78–88]
|
Kahl, Nathan
|
|
|
371 |
C |
p. 276-277
|
artikel
|
| 8 |
Corrigendum to “Transit functions and pyramid-like binary clustering systems” [Discrete Appl. Math. 357 (2024) 365–384]
|
Changat, Manoj
|
|
|
371 |
C |
p. 280
|
artikel
|
| 9 |
Double Roman domination stability in graphs
|
Zhuang, Wei
|
|
|
371 |
C |
p. 254-263
|
artikel
|
| 10 |
Editorial Board
|
|
|
|
371 |
C |
p. ii
|
artikel
|
| 11 |
Fault-tolerant strong Menger connectivity with conditional faults on wheel networks
|
Wang, Shiying
|
|
|
371 |
C |
p. 115-126
|
artikel
|
| 12 |
Finding spanning trees with perfect matchings
|
Bérczi, Kristóf
|
|
|
371 |
C |
p. 137-147
|
artikel
|
| 13 |
Forbidden Pairs of disconnected graphs for traceability and hamiltonicity
|
Liao, Hongli
|
|
|
371 |
C |
p. 105-114
|
artikel
|
| 14 |
Further results on injective edge coloring of graphs with maximum degree 5
|
Lu, Jian
|
|
|
371 |
C |
p. 176-184
|
artikel
|
| 15 |
Generalized competitively orientable complete multipartite graphs
|
Choi, Myungho
|
|
|
371 |
C |
p. 65-72
|
artikel
|
| 16 |
Grundy packing coloring of graphs
|
Gözüpek, Didem
|
|
|
371 |
C |
p. 17-30
|
artikel
|
| 17 |
Nordhaus–Gaddum decompositions for group coloring and DP coloring
|
Bickle, Allan
|
|
|
371 |
C |
p. 264-269
|
artikel
|
| 18 |
On average sizes and enumeration of minimal edge covers
|
Engbers, John
|
|
|
371 |
C |
p. 148-164
|
artikel
|
| 19 |
On disjunction convex hulls by big-M lifting
|
Qu, Yushan
|
|
|
371 |
C |
p. 31-45
|
artikel
|
| 20 |
Ore-type condition for Hamilton ℓ -cycle in k -uniform hypergraphs
|
Jiang, Taijiang
|
|
|
371 |
C |
p. 270-275
|
artikel
|
| 21 |
Preprocessing complexity for some graph problems parameterized by structural parameters
|
Lafond, Manuel
|
|
|
371 |
C |
p. 46-59
|
artikel
|
| 22 |
Proof of a conjecture on isolation of graphs dominated by a vertex
|
Borg, Peter
|
|
|
371 |
C |
p. 247-253
|
artikel
|
| 23 |
Research problems from the 1st Chinese–Southeasteuropean conference on discrete mathematics and applications
|
Krčadinac, Vedran
|
|
|
371 |
C |
p. 99-104
|
artikel
|
| 24 |
Semi-proper orientations of dense graphs
|
Araújo, Júlio
|
|
|
371 |
C |
p. 196-217
|
artikel
|
| 25 |
Some new bounds for the energy of graphs
|
Dong, Jiuying
|
|
|
371 |
C |
p. 73-79
|
artikel
|
| 26 |
The polynomial reconstruction problem for graphs having cut-vertices of degree two
|
Farrugia, Alexander
|
|
|
371 |
C |
p. 165-175
|
artikel
|
| 27 |
Three results towards approximation of special maximum matchings in graphs
|
Mkrtchyan, Vahan
|
|
|
371 |
C |
p. 127-136
|
artikel
|
| 28 |
Two-disjoint-cycle-cover pancyclicity of augmented cubes
|
Cheng, Dongqin
|
|
|
371 |
C |
p. 240-246
|
artikel
|
Tijdschrift beschrijving