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