nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A recognition algorithm for simple-triangle graphs
|
Takaoka, Asahi |
|
|
282 |
C |
p. 196-207 |
artikel |
2 |
Dominating maximal outerplane graphs and Hamiltonian plane triangulations
|
Plummer, Michael D. |
|
|
282 |
C |
p. 162-167 |
artikel |
3 |
Edge-coloring of plane multigraphs with many colors on facial cycles
|
Czap, Július |
|
|
282 |
C |
p. 80-85 |
artikel |
4 |
Edge coloring of signed graphs
|
Zhang, Li |
|
|
282 |
C |
p. 234-242 |
artikel |
5 |
Editorial Board
|
|
|
|
282 |
C |
p. ii |
artikel |
6 |
Embedding planar 5-graphs in three pages
|
Guan, Xiaxia |
|
|
282 |
C |
p. 108-121 |
artikel |
7 |
Estimating the r -colorability threshold for a random hypergraph
|
Shabanov, Dmitry A. |
|
|
282 |
C |
p. 168-183 |
artikel |
8 |
Generalized cut method for computing the edge-Wiener index
|
Tratnik, Niko |
|
|
282 |
C |
p. 222-233 |
artikel |
9 |
Hamiltonian cycles in covering graphs of trees
|
Hell, Pavol |
|
|
282 |
C |
p. 271-281 |
artikel |
10 |
Kernels by rainbow paths in arc-colored tournaments
|
Bai, Yandong |
|
|
282 |
C |
p. 14-21 |
artikel |
11 |
Limited visibility Cops and Robber
|
Clarke, N.E. |
|
|
282 |
C |
p. 53-64 |
artikel |
12 |
Maker–Breaker total domination game
|
Gledel, Valentin |
|
|
282 |
C |
p. 96-107 |
artikel |
13 |
Minimal graphs for 2-factor extension
|
Costa, M.-C. |
|
|
282 |
C |
p. 65-79 |
artikel |
14 |
Near-optimal induced universal graphs for cycles and paths
|
Abrahamsen, Mikkel |
|
|
282 |
C |
p. 1-13 |
artikel |
15 |
On disks of the triangular grid: An application of optimization theory in discrete geometry
|
Kovács, Gergely |
|
|
282 |
C |
p. 136-151 |
artikel |
16 |
On-line Ramsey numbers for paths and short cycles
|
Dybizbański, Janusz |
|
|
282 |
C |
p. 265-270 |
artikel |
17 |
On the P 3 -hull number of Hamming graphs
|
Brešar, Boštjan |
|
|
282 |
C |
p. 48-52 |
artikel |
18 |
On the radius of nonsplit graphs and information dissemination in dynamic networks
|
Függer, Matthias |
|
|
282 |
C |
p. 257-264 |
artikel |
19 |
On the zero blocking number of rectangular, cylindrical, and Möbius grids
|
Beaudouin-Lafon, Matthew |
|
|
282 |
C |
p. 35-47 |
artikel |
20 |
Parikh word representability of bipartite permutation graphs
|
Teh, Wen Chean |
|
|
282 |
C |
p. 208-221 |
artikel |
21 |
Path 3-(edge-)connectivity of lexicographic product graphs
|
Ma, Tianlong |
|
|
282 |
C |
p. 152-161 |
artikel |
22 |
The expected values for the Schultz index, Gutman index, multiplicative degree-Kirchhoff index and additive degree-Kirchhoff index of a random polyphenylene chain
|
Zhang, Leilei |
|
|
282 |
C |
p. 243-256 |
artikel |
23 |
The niche graphs of bipartite tournaments
|
Eoh, Soogang |
|
|
282 |
C |
p. 86-95 |
artikel |
24 |
The security of all private-key bits in isogeny-based schemes
|
Shani, Barak |
|
|
282 |
C |
p. 184-195 |
artikel |
25 |
Tracking Paths
|
Banik, Aritra |
|
|
282 |
C |
p. 22-34 |
artikel |
26 |
Zero forcing and maximum nullity for hypergraphs
|
Hogben, Leslie |
|
|
282 |
C |
p. 122-135 |
artikel |