G. Boruzanli Ekinci, J.B. Gauci

The super-connectivity of Kneser graphs

X. Chen, G. Hao, Z. Xie

A note on Roman domination of digraphs

J.-X. Guan, J.-H. Yin

The bipartite-splittance of a bipartite graph

M. Lu, W. Ning , K. Wang

Bounding the locating-total domination number of a tree in terms of its annihilation number

N. Jafari Rad, H. Rahbani

Some progress on the double Roman domination in graphs

Y.T. Shi, J. Tu

An efficient polynomial time approximation scheme for the vertex cover $P_ 3$ problem on planar graphs

X. Chen, G. Hao, L. Volkmann

Bounds on the signed Roman $k$-domination number of a digraph

M. Horňák, S. Jendrol', R. Soták

Facial incidence colorings of embedded multigraphs

S. Wang, G. Zhang

Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity

Y. Sakamoto

Hamilton cycles in double generalized Petersen graphs

H. Ren , C. Yang

New formulae for the decycling number of graphs

S. Bhoumik, S. Mitra

$L$(2,1)-labeling of circulant graphs

R. J. Gould, P. Horn, M.S. Jacobson, B.J. Thomas

Gaps in the saturation spectrum of trees

T.M. Lewis

On the Hamiltonian number of a plane graph

R.-X. Hao, Y. Yuan

Independence number, connectivity and all fractional ($a,b,k$)-critical graphs

C. Duffy, G. MacGillivray, P. Ochem, A. Raspaud

Oriented incidence colourings of digraphs

J. Dybizbański, A. Nenca

Oriented chromatic number of Cartesian products and strong products of paths

W. Goddard, R. Melville, H. Xu

Almost injective colorings

Y.M. Borse, S.R. Shaikh

Decomposition of the product of cycles based on degree partition

R.K. Yeh

Pair $L$(2,1)-labelings of infinite graphs

D.B. West, J.I. Wise

Antipodal edge-colorings of hypercubes

I. Gorgol, A. Lechowska

Anti-Ramsey number of Hanoi graphs