Accepted papers

1 Bodroža-Patić, R. Doroslovački, H. Kwong, M. Pantić
A limit conjecture on the number of Hamiltonian cycles on thin triangular grid cylinder graphs
2 M. Horňák, J. Hudák
On the palette index of complete bipartite graphs
3 D. Kuziak, I. Peterin, I.G. Yero
Bounding the open k-monopoly number of strong product graphs
4 S. Bermudo, J.C. Hernández-Gómez, J.M. Sigarreta
On the total k-domination in graphs
5 T. Han, R. Li
Arc-disjont Hamiltonian cycles in round decomposable local tournaments
6 F. Ma, J. Yan
On the number of disjoint 4-cycles in regular tournaments
7 R. Rasi, S.M. Sheikholeslami
The smallest index of trees with given maximum degree
8 N. Mandal, P. Panigrahi
Irreducible no-hole L(2,1)-coloring of edge-multiplicity-paths-replacement graph
9 M.R. Oboudi
Some results on the independence polynomial of unicyclic graphs
10 S. Cockburn
Homomorphic preimages of geometric paths
11 J. Cyman, M. Dettlaff, M.A. Henning, M. Lemańska, J. Raczek
Total domination in versus paired-domination in regular graphs
12 O.V. Borodin, A.O. Ivanova, O.N. Kazak
Describing neighborhoods in 3-polytopes with minimum degree 5 and without vertices of degree from 7 to 11
13 B. Amari, A. Berrachedi
Generalized Hamming graphs: some new results
14 A.P. Wojda
Almost self-complementary uniform hypergraphs
15 Z. Bi, G. Chartrand, P. Zhang
Another view of bipartite Ramsey numbers
16 I. Peterin, J. Schreyer, E. Škrabul'áková, A. Taranenko
A note on the Thue chromatic number of lexicographic produts of graphs
17 S.A. Aleid, J. Cáceres, M. Luz Puertas
On independent [1,2]-sets in trees
18 P. Hrnčiar, G. Monoszová
Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
19 R. Ichishima, S.C. López , F.A. Muntaner-Batle, A. Oshima
On the beta-number of forests with isomorphic components
20 M. Edwards, G. MacGillivray, S. Nasserasr
Reconfiguring minimum dominating sets: the γ-graph of a tree
21 H. Liu, T. Sousa
Turán function and H-decomposition for GEM graphs
22 Y. Boudabbous, P. Ille
The {-2,-1}-selfdual and decomposable tournaments
23 Z. Dziechcińska-Halamoda, J. Górska, Z. Majcher, J. Michael, Z. Skupień
Extremal irregular digraphs
24 X. Hong
Completely independent spanning trees in k-th power of graphs
25 L. Kang, E. Shan
Trees with unique least central subtrees
26 A. Dong, X. Zhang
Equitable coloring and equitable choosability of graphs with small maximum average degree
27 Z. Stanić
Pertubations in a signed graph and its index
28 M. Besson, B. Tesman
TR-span of directed wheel graphs
29 Y.M. Borse, G. Mundhe
Graphic and cographic Γ-extensionds of binary matroids
30 Z. Ding, Y. Huang
The crossing numbers of join of some graphs with n isolated vertices
31 J. Czap, S. Jendrol', J. Valiska
Conflict -free connections of graphs
32 B. Wang, L. Wang, K. Xiang
The largest component in critical graphs
33 H. Li , B. Wu, W. Yang
Making a dominating set of a graph connected
34 G. Boruzanli Ekinci, J.B. Gauci
The super-connectivity of Kneser graphs
35 B. Brešar, T.R. Hartinger, T. Kos, M. Milanič
On total domination in the Cartesian product of graphs
36 L. Sun , B. Wang, J.-L. Wu
Total colorings of embedded graphs with maximum degree seven and without 3-cycles adjacent to 4-cycles
37 H. Cai, Z.Y. Luo, D. Sun , L. Sun , J.-L. Wu
On edge colorings of 1-planar graphs without 5-cycles with two chords
38 H. Aram, M. Atapour, S.M. Sheikholeslami
Eternal m-security bondage numbers in graphs
39 G. Chartrand, S. Devereaux, T.W. Haynes, S.T. Hedetniemi, P. Zhang
Rainbow disconnection in graphs
40 J.-X. Guan, J.-H. Yin
The bipartite-splittance of a bipartite graph
41 Z. Jin, Y. Sun, J. Tu
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number
42 M. Lu, W. Ning , K. Wang
Bounding the locating-total domination number of a tree in terms of its annihilation number
43 N. Jafari Rad, H. Rahbani
Some progress on the double Roman domination in graphs
44 Y.T. Shi, J. Tu
An efficient polynomial time approximation scheme for the vertex cover P3 problem on planar graphs
45 X. Chen, G. Hao, L. Volkmann
Bounds on the signed Roman k-domination number of a digraph
46 S. Kerdjoudj, A.V. Kostochka, A. Raspaud
List star edge coloring of subcubic graphs
47 M. Horňák, S. Jendrol', R. Soták
Facial incidence colorings of embedded multigraphs
48 S. Wang, G. Zhang
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
49 Y. Sakamoto
Hamilton cycles in double generalized Petersen graphs
50 H. Ren , C. Yang
New formulae for the decycling number of graphs
51 S. Bhoumik, S. Mitra
L(2,1) labeling of circulant graphs
52 R. J. Gould, P. Horn, M.S. Jacobson, B.J. Thomas
Gaps in the saturation spectrum of trees
53 T.M. Lewis
On the Hamiltonian number of a planar graph
54 R.-X. Hao, Y. Yuan
Independence number, connectivity and all fractional (a,b,k)-critical graphs
55 C. Duffy, G. MacGillivray, P. Ochem, A. Raspaud
Oriented incidence colourings of digraphs
56 J. Dybizbański, A. Nenca
Oriented chromatic number of Cartesian products and strong products of paths
57 W. Goddard, R. Melville, H. Xu
Almost injective colorings
58 Y.M. Borse, S.R. Shaikh
Decomposition of the product of cycles based on the degree partition
59 R.K. Yeh
Pair L(2,1)-labelings of infinite graphs
60 D.B. West, J.I. Wise
Antipodal edge-colorings of hypercubes
61 I. Gorgol, A. Lechowska
Anti-Ramsey number of Hanoi graphs
62 M. Benatallah, N. Ikhlef- Eschouf, M. Mihoubi
On the b-domatic number of graphs
63 M. Rajeswari, I. Sahul Hamid
Global dominator coloring of graphs
64 R. Bailey, I.G. Yero
Error-correcting codes from k-resolving sets
65 N. Haghparast, D. Kiani
Edge-connectivity and edges of even factors of graphs
66 S. Špacapan
On 3-colorings of direct products of graphs
67 X. Liu, Z. Shao, S.M. Sheikholeslami, M. Soroudi, L. Volkmann
On the co-Roman domination in graphs
68 D. Pillone
Arankings of trees
69 N. Polat
On some characterizations of antipodal partial cubes
70 K. Diao, P. Zhao
More results on the smallest one-realization of a given set II
71 M. Hajian, N. Jafari Rad
Fair domination number in cactus graphs
72 H.S. Boregowda, B. Chaluvaraju, V.R. Kulli
The product connectivity banhatti index of a graph
73 J. Amjadi, S.M. Sheikholeslami, M. Soroudi
On the total Roman domination in trees
74 S. Cichacz, B. Freyberg, D. Froncek
Orientable Zn-distance magic graphs
75 Y. Huang, Z. Ouyang, J. Wang
The crossing number of the hexagonal graph H3,n
76 R. Li , B. Sheng
The second neighbourhood for bipartite tournaments
77 X. Chen, G. Hao, Z. Xie
A note on Roman domination of digraphs

Your IP address: