| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A classification of edge-colored graphs based on properly colored walks
|
Li, Ruonan
|
|
|
283 |
C |
p. 590-595
|
artikel
|
| 2 |
A connected version of the graph coloring game
|
Charpentier, Clément
|
|
|
283 |
C |
p. 744-750
|
artikel
|
| 3 |
A model for finding transition-minors
|
Klocker, Benedikt
|
|
|
283 |
C |
p. 242-264
|
artikel
|
| 4 |
An improved upper bound for the acyclic chromatic number of 1-planar graphs
|
Yang, Wanshun
|
|
|
283 |
C |
p. 275-291
|
artikel
|
| 5 |
A note on partitions of graphs under degree constraints
|
Zu, Chunlei
|
|
|
283 |
C |
p. 631-633
|
artikel
|
| 6 |
A polynomial algorithm for minimizing discrete convic functions in fixed dimension
|
Veselov, S.I.
|
|
|
283 |
C |
p. 11-19
|
artikel
|
| 7 |
A procedural egalitarian solution for NTU-games
|
Dietzenbacher, Bas
|
|
|
283 |
C |
p. 20-27
|
artikel
|
| 8 |
Broadcasts on paths and cycles
|
Bouchouika, Sabrina
|
|
|
283 |
C |
p. 375-395
|
artikel
|
| 9 |
Characterising circular-arc contact B 0 –VPG graphs
|
Bonomo-Braberman, Flavia
|
|
|
283 |
C |
p. 435-443
|
artikel
|
| 10 |
Comments on “A Hamilton sufficient condition for completely independent spanning tree”
|
Qin, Xiao-Wen
|
|
|
283 |
C |
p. 730-733
|
artikel
|
| 11 |
Conflict-free connection number of random graphs
|
Gu, Ran
|
|
|
283 |
C |
p. 522-532
|
artikel
|
| 12 |
Connected domination in maximal outerplanar graphs
|
Zhuang, Wei
|
|
|
283 |
C |
p. 533-541
|
artikel
|
| 13 |
Constant work-space algorithms for facility location problems
|
Bhattacharya, Binay K.
|
|
|
283 |
C |
p. 456-472
|
artikel
|
| 14 |
Counting and enumerating galled networks
|
Gunawan, Andreas D.M.
|
|
|
283 |
C |
p. 644-654
|
artikel
|
| 15 |
Diagonal flips in plane graphs with triangular and quadrangular faces
|
Matsumoto, Naoki
|
|
|
283 |
C |
p. 292-305
|
artikel
|
| 16 |
Editorial Board
|
|
|
|
283 |
C |
p. ii
|
artikel
|
| 17 |
Eternal domination on prisms of graphs
|
Krim-Yee, Aaron
|
|
|
283 |
C |
p. 734-736
|
artikel
|
| 18 |
Existence of all generalized fractional ( g , f ) -factors of graphs
|
Egawa, Yoshimi
|
|
|
283 |
C |
p. 265-271
|
artikel
|
| 19 |
Fair division with multiple pieces
|
Nyman, Kathryn
|
|
|
283 |
C |
p. 115-122
|
artikel
|
| 20 |
Few-weight codes over F p + u F p associated with down sets and their distance optimal Gray image
|
Wu, Yansheng
|
|
|
283 |
C |
p. 315-322
|
artikel
|
| 21 |
Finding dominating induced matchings in S 2 , 2 , 3 -free graphs in polynomial time
|
Brandstädt, Andreas
|
|
|
283 |
C |
p. 417-434
|
artikel
|
| 22 |
Further results on the Merrifield–Simmons index
|
Hua, Hongbo
|
|
|
283 |
C |
p. 231-241
|
artikel
|
| 23 |
Game of pure chance with restricted boundary
|
Leung, Ho-Hon
|
|
|
283 |
C |
p. 613-625
|
artikel
|
| 24 |
Generalized bent Boolean functions and strongly regular Cayley graphs
|
Riera, Constanza
|
|
|
283 |
C |
p. 367-374
|
artikel
|
| 25 |
Generalized Fitch graphs II: Sets of binary relations that are explained by edge-labeled trees
|
Hellmuth, Marc
|
|
|
283 |
C |
p. 495-511
|
artikel
|
| 26 |
Global defensive alliances in the lexicographic product of paths and cycles
|
Barbosa, Rommel M.
|
|
|
283 |
C |
p. 168-188
|
artikel
|
| 27 |
How tree-based is my network? Proximity measures for unrooted phylogenetic networks
|
Fischer, Mareike
|
|
|
283 |
C |
p. 98-114
|
artikel
|
| 28 |
Integral cographs
|
Allem, Luiz Emilio
|
|
|
283 |
C |
p. 153-167
|
artikel
|
| 29 |
Letter graphs and geometric grid classes of permutations: Characterization and recognition
|
Alecu, Bogdan
|
|
|
283 |
C |
p. 482-494
|
artikel
|
| 30 |
Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms
|
Komusiewicz, Christian
|
|
|
283 |
C |
p. 44-58
|
artikel
|
| 31 |
Matchings in graphs with a given number of cuts
|
Liu, Jinfeng
|
|
|
283 |
C |
p. 473-481
|
artikel
|
| 32 |
New bounds on clique-chromatic numbers of Johnson graphs
|
Raigorodskii, A.M.
|
|
|
283 |
C |
p. 724-729
|
artikel
|
| 33 |
New lower bounds for Tverberg partitions with tolerance in the plane
|
Bereg, Sergey
|
|
|
283 |
C |
p. 596-603
|
artikel
|
| 34 |
New orthogonality criterion for shortest vector of lattices and its applications
|
Lee, Hyang-Sook
|
|
|
283 |
C |
p. 323-335
|
artikel
|
| 35 |
On m -step competition graphs of bipartite tournaments
|
Eoh, Soogang
|
|
|
283 |
C |
p. 199-206
|
artikel
|
| 36 |
On partial cubes, well-graded families and their duals with some applications in graphs
|
Mofidi, Alireza
|
|
|
283 |
C |
p. 207-230
|
artikel
|
| 37 |
On polynomial time inflation algorithm for loop-free non-negative edge-bipartite graphs
|
Zając, Katarzyna
|
|
|
283 |
C |
p. 28-43
|
artikel
|
| 38 |
On the anti-Kekulé number of (4,5,6)-fullerenes
|
Zhao, Lifang
|
|
|
283 |
C |
p. 577-589
|
artikel
|
| 39 |
On the complexity and approximation of the maximum expected value all-or-nothing subset
|
Goldberg, Noam
|
|
|
283 |
C |
p. 1-10
|
artikel
|
| 40 |
On the equivalence of cylinder tilings and planar electric networks
|
Amiet, Ben
|
|
|
283 |
C |
p. 762-769
|
artikel
|
| 41 |
On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent
|
Moscarini, Marina
|
|
|
283 |
C |
p. 142-152
|
artikel
|
| 42 |
On the Kirchhoff index of bipartite graphs with given diameters
|
Jiang, Xiaojing
|
|
|
283 |
C |
p. 512-521
|
artikel
|
| 43 |
On the number of edges in a graph with many two-hop disjoint paths
|
Takayama, Koki
|
|
|
283 |
C |
p. 718-723
|
artikel
|
| 44 |
On the number of edges in some graphs
|
Lai, Chunhui
|
|
|
283 |
C |
p. 751-755
|
artikel
|
| 45 |
On the structure of 4-regular planar well-covered graphs
|
Finbow, Arthur S.
|
|
|
283 |
C |
p. 655-688
|
artikel
|
| 46 |
Packing ( 1 , 1 , 2 , 2 ) -coloring of some subcubic graphs
|
Liu, Runrun
|
|
|
283 |
C |
p. 626-630
|
artikel
|
| 47 |
Packing, partitioning, and covering symresacks
|
Hojny, Christopher
|
|
|
283 |
C |
p. 689-717
|
artikel
|
| 48 |
Parameterized algorithms for Module Map problems
|
Sommer, Frank
|
|
|
283 |
C |
p. 396-416
|
artikel
|
| 49 |
Parameterized complexity of independent set reconfiguration problems
|
Ito, Takehiro
|
|
|
283 |
C |
p. 336-345
|
artikel
|
| 50 |
Partial domination of maximal outerplanar graphs
|
Borg, Peter
|
|
|
283 |
C |
p. 306-314
|
artikel
|
| 51 |
Recognizing generalized Petersen graphs in linear time
|
Krnc, Matjaž
|
|
|
283 |
C |
p. 756-761
|
artikel
|
| 52 |
Recognizing generating subgraphs in graphs without cycles of lengths 6 and 7
|
Tankus, David
|
|
|
283 |
C |
p. 189-198
|
artikel
|
| 53 |
Roman { 3 } -domination (double Italian domination)
|
Mojdeh, Doost Ali
|
|
|
283 |
C |
p. 555-564
|
artikel
|
| 54 |
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
|
Ge, Jun
|
|
|
283 |
C |
p. 542-554
|
artikel
|
| 55 |
Sparse recovery with integrality constraints
|
Lange, Jan-Hendrik
|
|
|
283 |
C |
p. 346-366
|
artikel
|
| 56 |
The average Laplacian polynomial of a graph
|
Zhang, Yanan
|
|
|
283 |
C |
p. 737-743
|
artikel
|
| 57 |
The b -branching problem in digraphs
|
Kakimura, Naonori
|
|
|
283 |
C |
p. 565-576
|
artikel
|
| 58 |
The clique problem with multiple-choice constraints under a cycle-free dependency graph
|
Bärmann, Andreas
|
|
|
283 |
C |
p. 59-77
|
artikel
|
| 59 |
The complete set of minimal simple graphs that support unsatisfiable 2-CNFs
|
Karve, Vaibhav
|
|
|
283 |
C |
p. 123-132
|
artikel
|
| 60 |
The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
|
Xiao, Peng
|
|
|
283 |
C |
p. 444-455
|
artikel
|
| 61 |
Total domination cover rubbling
|
Beeler, Robert A.
|
|
|
283 |
C |
p. 133-141
|
artikel
|
| 62 |
Trees with maximum exponential Randić index
|
Cruz, Roberto
|
|
|
283 |
C |
p. 634-643
|
artikel
|
| 63 |
Upper bounds for bar visibility of subgraphs and n -vertex graphs
|
Feng, Yuanrui
|
|
|
283 |
C |
p. 272-274
|
artikel
|
| 64 |
Using semidirect products of groups to build classes of interconnection networks
|
Stewart, Iain A.
|
|
|
283 |
C |
p. 78-97
|
artikel
|
| 65 |
Zero-divisor graph of a poset with respect to an automorphism
|
Patil, Avinash
|
|
|
283 |
C |
p. 604-612
|
artikel
|
Tijdschrift beschrijving