M. Borowiecki, I. Broere

Hamiltonicity and generalised total colourings of planar graphs

Péter G.N. Szabó

Bounds on the number of edges of edge-minimal, edge-maximal and $l$-hypertrees

N. Mandal, P. Panigrahi

Solutions of some $L(2,1)$-coloring related open problems

S. Cichacz, D. Froncek, E. Krop, C. Raridan

Distance magic Cartesian product of graphs

H. Galeana-Sánchez, R. Sánchez-López

Kernels by monochromatic paths and color-perfect digraphs

H. Zhang, X. Zhou

A maximum resonant set of polyomino graphs

S. Jendrol', M. Maceková, M. Montassier, R. Soták

3-path in graphs with bounded average degree

L. Chen, B. Huo, Y. Ma

Hardness results for total rainbow connection of graphs

B. Li, L. Xiong, J. Yin

Large degree vertices in longest cycles of graphs, I

B. Li, S. Zhang

Heavy subgraph conditions for longest cycles to be heavy in graphs

M. Gutierrez, S.B. Tondato

End simplicial vertices in path graphs

Z. Sun, F. Yang, S. Zhou

A neighborhood condition for fractional ID-[$a,b$]-factor-critical graphs

B.Y. Bam, C. M. Deshpande, L. N. Kamble

The existence of quasi regular and bi-regular self-complementary 3-uniform hypergraphs

M.A. Henning, Ch. Löwenstein

A characterization of hypergraphs with large domination number

E. Laforge, C. Lumduanhom, P. Zhang

Characterizations of graphs having large proper connection numbers

I. Gutman, X. Li, Y. Mao

The Steiner Wiener index of a graph

S.M. Hosseini Moghaddam, D.A. Mojdeh, B. Samadi, L. Volkmann

New bounds on the signed total domination number of graphs

I. Broere, J. Heidema, M.D.V. Matsoha

The quest for a characterization of hom-properties of finite character