nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A 3 4 -approximation of Vizing’s conjecture for claw-free graphs
|
Brešar, Boštjan |
|
|
284 |
C |
p. 416-422 |
artikel |
2 |
Adynamic coloring of graphs
|
Šurimová, Mária |
|
|
284 |
C |
p. 224-233 |
artikel |
3 |
Burning number of caterpillars
|
Liu, Huiqing |
|
|
284 |
C |
p. 332-340 |
artikel |
4 |
Complexity aspects of ℓ -chord convexities
|
Dourado, Mitre C. |
|
|
284 |
C |
p. 585-591 |
artikel |
5 |
Complexity of planar signed graph homomorphisms to cycles
|
Dross, François |
|
|
284 |
C |
p. 166-178 |
artikel |
6 |
1-2-3 Conjecture in digraphs: More results and directions
|
Bensmail, Julien |
|
|
284 |
C |
p. 124-137 |
artikel |
7 |
Connected greedy coloring of H -free graphs
|
Mota, Esdras |
|
|
284 |
C |
p. 572-584 |
artikel |
8 |
Constructive characterizations concerning weak Roman domination in trees
|
Cabrera-Martínez, Abel |
|
|
284 |
C |
p. 384-390 |
artikel |
9 |
Corrigendum to “On strongly regular signed graphs” [Discrete Applied Mathematics 271 (2019) 184–190]
|
Stanić, Zoran |
|
|
284 |
C |
p. 640 |
artikel |
10 |
Cube-free resonance graphs
|
Che, Zhongyuan |
|
|
284 |
C |
p. 262-268 |
artikel |
11 |
Cycle energy and its size dependence
|
Gutman, Ivan |
|
|
284 |
C |
p. 534-537 |
artikel |
12 |
Decomposing a graph into shortest paths with bounded eccentricity
|
Birmelé, Etienne |
|
|
284 |
C |
p. 353-374 |
artikel |
13 |
Domination and location in twin-free digraphs
|
Foucaud, Florent |
|
|
284 |
C |
p. 42-52 |
artikel |
14 |
Double domination in lexicographic product graphs
|
Cabrera Martínez, Abel |
|
|
284 |
C |
p. 290-300 |
artikel |
15 |
Dynamic programming bi-criteria combinatorial optimization
|
Mankowski, Michal |
|
|
284 |
C |
p. 513-533 |
artikel |
16 |
Edge decomposition of connected claw-free cubic graphs
|
Hong, Yanmei |
|
|
284 |
C |
p. 246-250 |
artikel |
17 |
Editorial Board
|
|
|
|
284 |
C |
p. ii |
artikel |
18 |
Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization
|
Kudin, S. |
|
|
284 |
C |
p. 150-157 |
artikel |
19 |
Enumeration and extensions of word-representants
|
Gaetz, Marisa |
|
|
284 |
C |
p. 423-433 |
artikel |
20 |
Extremal trees of given segment sequence with respect to some eccentricity-based invariants
|
Zhang, Minjie |
|
|
284 |
C |
p. 111-123 |
artikel |
21 |
Finding dominating induced matchings in S 1 , 1 , 5 -free graphs in polynomial time
|
Brandstädt, Andreas |
|
|
284 |
C |
p. 269-280 |
artikel |
22 |
Finding non-minority balls with majority and plurality queries
|
Chang, Huilan |
|
|
284 |
C |
p. 631-639 |
artikel |
23 |
General eccentric connectivity index of trees and unicyclic graphs
|
Vetrík, Tomáš |
|
|
284 |
C |
p. 301-315 |
artikel |
24 |
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs
|
Bessy, Stéphane |
|
|
284 |
C |
p. 195-200 |
artikel |
25 |
Grundy dominating sequences on X -join product
|
Nasini, Graciela |
|
|
284 |
C |
p. 138-149 |
artikel |
26 |
How to build a graph in n days: Some variations of graph assembly
|
Dougherty, Aria L. |
|
|
284 |
C |
p. 20-28 |
artikel |
27 |
Independent ( k + 1 ) -domination in k -trees
|
Borowiecki, Mieczysław |
|
|
284 |
C |
p. 99-110 |
artikel |
28 |
Interval robustness of (interval) max-plus matrices
|
Myšková, Helena |
|
|
284 |
C |
p. 8-19 |
artikel |
29 |
L ( p , q ) -labeling of planar graphs with small girth
|
Dong, Wei |
|
|
284 |
C |
p. 592-601 |
artikel |
30 |
Maximum nullity and zero forcing number on graphs with maximum degree at most three
|
Alishahi, Meysam |
|
|
284 |
C |
p. 179-194 |
artikel |
31 |
Metric dimension and pattern avoidance in graphs
|
Geneson, Jesse |
|
|
284 |
C |
p. 1-7 |
artikel |
32 |
Minor-obstructions for apex sub-unicyclic graphs
|
Leivaditis, Alexandros |
|
|
284 |
C |
p. 538-555 |
artikel |
33 |
Multilevel secret sharing schemes arising from the normal rational curve
|
Caputo, Stefania |
|
|
284 |
C |
p. 158-165 |
artikel |
34 |
Non-hamiltonian 1-tough triangulations with disjoint separating triangles
|
Fujisawa, Jun |
|
|
284 |
C |
p. 622-625 |
artikel |
35 |
Normalized Laplacian spectrum of complete multipartite graphs
|
Sun, Shaowei |
|
|
284 |
C |
p. 234-245 |
artikel |
36 |
On coloring the arcs of biregular graphs
|
Dejter, Italo J. |
|
|
284 |
C |
p. 489-498 |
artikel |
37 |
On energy and Laplacian energy of chain graphs
|
Das, Kinkar Chandra |
|
|
284 |
C |
p. 391-400 |
artikel |
38 |
On highly palindromic words: The ternary case
|
Ago, Kristina |
|
|
284 |
C |
p. 434-443 |
artikel |
39 |
On k -rainbow domination in regular graphs
|
Kuzman, Boštjan |
|
|
284 |
C |
p. 454-464 |
artikel |
40 |
On matroid parity and matching polytopes
|
Kaparis, Konstantinos |
|
|
284 |
C |
p. 322-331 |
artikel |
41 |
On the degree Kirchhoff index of unicyclic graphs
|
Qi, Xuli |
|
|
284 |
C |
p. 86-98 |
artikel |
42 |
On the edge-Szeged index of unicyclic graphs with perfect matchings
|
He, Shengjie |
|
|
284 |
C |
p. 207-223 |
artikel |
43 |
On the extremal values of the eccentric distance sum of trees with a given maximum degree
|
Miao, Lianying |
|
|
284 |
C |
p. 375-383 |
artikel |
44 |
On the number of almost envy-free allocations
|
Suksompong, Warut |
|
|
284 |
C |
p. 606-610 |
artikel |
45 |
Perfect double Roman domination of trees
|
Egunjobi, Ayotunde T. |
|
|
284 |
C |
p. 71-85 |
artikel |
46 |
Planar graphs without short even cycles are near-bipartite
|
Liu, Runrun |
|
|
284 |
C |
p. 626-630 |
artikel |
47 |
Power domination in regular claw-free graphs
|
Lu, Changhong |
|
|
284 |
C |
p. 401-415 |
artikel |
48 |
Restricted matching in plane triangulations and near triangulations
|
Aldred, R.E.L. |
|
|
284 |
C |
p. 251-261 |
artikel |
49 |
Signed analogue of general Kotzig–Lovász decomposition
|
Kita, Nanao |
|
|
284 |
C |
p. 61-70 |
artikel |
50 |
Some notes on the extremal k -generalized quasi-unicyclic graphs with respect to Zagreb indices
|
Liu, Muhuo |
|
|
284 |
C |
p. 616-621 |
artikel |
51 |
Spanning 2-forests and resistance distance in 2-connected graphs
|
Barrett, Wayne |
|
|
284 |
C |
p. 341-352 |
artikel |
52 |
Spectral characterization of the complete graph removing a path
|
Liu, Muhuo |
|
|
284 |
C |
p. 499-512 |
artikel |
53 |
Stack words and a bound for 3-stack sortable permutations
|
Bóna, Miklós |
|
|
284 |
C |
p. 602-605 |
artikel |
54 |
Strong chromatic index of K 1 , t -free graphs
|
Dębski, Michał |
|
|
284 |
C |
p. 53-60 |
artikel |
55 |
Structure connectivity and substructure connectivity of star graphs
|
Li, Chunfang |
|
|
284 |
C |
p. 472-480 |
artikel |
56 |
The asymptotic value of graph energy for random graphs with degree-based weights
|
Li, Xueliang |
|
|
284 |
C |
p. 481-488 |
artikel |
57 |
The generalized matcher game
|
Bachstein, Anna |
|
|
284 |
C |
p. 444-453 |
artikel |
58 |
The Hamming distances of repeated-root cyclic codes of length 5 p s
|
Li, Xia |
|
|
284 |
C |
p. 29-41 |
artikel |
59 |
The harmonic index of a graph and its DP-chromatic number
|
Lv, Jian-Bo |
|
|
284 |
C |
p. 611-615 |
artikel |
60 |
The iterated local model for social networks
|
Bonato, Anthony |
|
|
284 |
C |
p. 556-571 |
artikel |
61 |
The preclusion numbers and edge preclusion numbers in a class of Cayley graphs
|
Zhang, Guozhen |
|
|
284 |
C |
p. 465-471 |
artikel |
62 |
The target location function on finite trees
|
Leach, Trevor |
|
|
284 |
C |
p. 316-321 |
artikel |
63 |
Toughness and prism-hamiltonicity of P 4 -free graphs
|
Ellingham, M.N. |
|
|
284 |
C |
p. 201-206 |
artikel |
64 |
Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs
|
Cordero-Michel, Narda |
|
|
284 |
C |
p. 281-289 |
artikel |