5 | -- | 22 | Eric Andrews, Futaba Fujie, Kyle Kolasinski, Chira Lumduanhom, Adam Yusko. On monochromatic subgraphs of edge-colored complete graphs |
23 | -- | 29 | Ioan Tomescu. Hypergraphs with pendant paths are not chromatically unique |
31 | -- | 48 | Sagnik Sen. L(2, 1)-labelings of some famillies of oriented planar graphs |
49 | -- | 56 | Wei Li, Shunyi Liu, Heping Zhang. A note on the permanental roots of bipartite graphs |
57 | -- | 74 | Carlos Araújo, Italo J. Dejter. Lattice-like perfect codes |
75 | -- | 84 | Jaroslav Ivanco, Tatiana Polláková. Supermagic graphs having a saturated vertex |
85 | -- | 93 | David Offner. Packing the hypercube |
95 | -- | 102 | Hong-Hai Li, Li Su, Jing Zhang. The minimum spetral radius of signless Laplacian of graphs with a given clique number |
103 | -- | 111 | Hong-Hai Li, Li Su, Jing Zhang. q-distance matrix of a graph |
113 | -- | 125 | Atif A. Abueida, Chester Lian. On the decompositions of complete graphs into cycles and stars on the same number of edges |
127 | -- | 136 | Erfang Shan, Dingguo Wang. On the numbers of cut-vertices and end-blocks in 4-regular graphs |
137 | -- | 150 | Tanja Gologranc. Tree-like partial Hamming graphs |
151 | -- | 166 | Jachoon Kim, Alexandr V. Kostochka. Maximum hypergraphs without regular subgraphs |
167 | -- | 185 | Pavol Hell, César Hernández-Cruz. On the complexity of the 3-kernel problem in some classes of digraphs |
187 | -- | 191 | Martin Knor. Smallest regular graphs of given degree and diameter |
193 | -- | 198 | Yoshimi Egawa, Mikio Kano, Zheng Yan. Star-cycle factors of graphs |
199 | -- | 201 | András Gyárfás. n-chromatic graphs |