Accepted papers

1 N. Mandal, P. Panigrahi
Irreducible no-hole L(2,1)-coloring of edge-multiplicity-paths-replacement graph
2 J. Cyman, M. Dettlaff, M.A. Henning, M. Lemańska, J. Raczek
Total domination in versus paired-domination in regular graphs
3 B. Amari, A. Berrachedi
Generalized Hamming graphs: some new results
4 A.P. Wojda
Almost self-complementary uniform hypergraphs
5 Z. Bi, G. Chartrand, P. Zhang
Another view of bipartite Ramsey numbers
6 I. Peterin, J. Schreyer, E. ©krabul'įkovį, A. Taranenko
A note on the Thue chromatic number of lexicographic produts of graphs
7 S.A. Aleid, J. Cįceres, M. Luz Puertas
On independent [1,2]-sets in trees
8 P. Hrnčiar, G. Monoszovį
Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
9 R. Ichishima, S.C. López , F.A. Muntaner-Batle, A. Oshima
On the beta-number of forests with isomorphic components
10 M. Edwards, G. MacGillivray, S. Nasserasr
Reconfiguring minimum dominating sets: the γ-graph of a tree
11 H. Liu, T. Sousa
Turán function and H-decomposition for GEM graphs
12 Y. Boudabbous, P. Ille
The {-2,-1}-selfdual and decomposable tournaments
13 Z. Dziechcińska-Halamoda, J. Górska, Z. Majcher, J. Michael, Z. Skupień
Extremal irregular digraphs
14 X. Hong
Completely independent spanning trees in k-th power of graphs
15 L. Kang, E. Shan
Trees with unique least central subtrees
16 A. Dong, X. Zhang
Equitable coloring and equitable choosability of graphs with small maximum average degree
17 Z. Stanię
Pertubations in a signed graph and its index
18 M. Besson, B. Tesman
TR-span of directed wheel graphs
19 Y.M. Borse, G. Mundhe
Graphic and cographic Γ-extensionds of binary matroids
20 Z. Ding, Y. Huang
The crossing numbers of join of some graphs with n isolated vertices
21 J. Czap, S. Jendrol', J. Valiska
Conflict -free connections of graphs
22 B. Wang, L. Wang, K. Xiang
The largest component in critical graphs
23 H. Li , B. Wu, W. Yang
Making a dominating set of a graph connected
24 G. Boruzanli Ekinci, J.B. Gauci
The super-connectivity of Kneser graphs
25 B. Bre¹ar, T.R. Hartinger, T. Kos, M. Milanič
On total domination in the Cartesian product of graphs
26 L. Sun , B. Wang, J.-L. Wu
Total colorings of embedded graphs with maximum degree seven and without 3-cycles adjacent to 4-cycles
27 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
28 H. Aram, M. Atapour, S.M. Sheikholeslami
Eternal m-security bondage numbers in graphs
29 G. Chartrand, S. Devereaux, T.W. Haynes, S.T. Hedetniemi, P. Zhang
Rainbow disconnection in graphs
30 J.-X. Guan, J.-H. Yin
The bipartite-splittance of a bipartite graph
31 Z. Jin, Y. Sun, J. Tu
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number
32 M. Lu, W. Ning , K. Wang
Bounding the locating-total domination number of a tree in terms of its annihilation number
33 N. Jafari Rad, H. Rahbani
Some progress on the double Roman domination in graphs
34 Y.T. Shi, J. Tu
An efficient polynomial time approximation scheme for the vertex cover P3 problem on planar graphs
35 X. Chen, G. Hao, L. Volkmann
Bounds on the signed Roman k-domination number of a digraph
36 S. Kerdjoudj, A.V. Kostochka, A. Raspaud
List star edge coloring of subcubic graphs
37 M. Horņįk, S. Jendrol', R. Sotįk
Facial incidence colorings of embedded multigraphs
38 S. Wang, G. Zhang
Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity
39 Y. Sakamoto
Hamilton cycles in double generalized Petersen graphs
40 H. Ren , C. Yang
New formulae for the decycling number of graphs
41 S. Bhoumik, S. Mitra
L(2,1) labeling of circulant graphs
42 R. J. Gould, P. Horn, M.S. Jacobson, B.J. Thomas
Gaps in the saturation spectrum of trees
43 T.M. Lewis
On the Hamiltonian number of a planar graph
44 R.-X. Hao, Y. Yuan
Independence number, connectivity and all fractional (a,b,k)-critical graphs
45 C. Duffy, G. MacGillivray, P. Ochem, A. Raspaud
Oriented incidence colourings of digraphs
46 J. Dybizbański, A. Nenca
Oriented chromatic number of Cartesian products and strong products of paths
47 W. Goddard, R. Melville, H. Xu
Almost injective colorings
48 Y.M. Borse, S.R. Shaikh
Decomposition of the product of cycles based on the degree partition
49 R.K. Yeh
Pair L(2,1)-labelings of infinite graphs
50 D.B. West, J.I. Wise
Antipodal edge-colorings of hypercubes
51 I. Gorgol, A. Lechowska
Anti-Ramsey number of Hanoi graphs
52 M. Benatallah, N. Ikhlef- Eschouf, M. Mihoubi
On the b-domatic number of graphs
53 M. Rajeswari, I. Sahul Hamid
Global dominator coloring of graphs
54 R. Bailey, I.G. Yero
Error-correcting codes from k-resolving sets
55 N. Haghparast, D. Kiani
Edge-connectivity and edges of even factors of graphs
56 S. ©pacapan
On 3-colorings of direct products of graphs
57 X. Liu, Z. Shao, S.M. Sheikholeslami, M. Soroudi, L. Volkmann
On the co-Roman domination in graphs
58 D. Pillone
Arankings of trees
59 N. Polat
On some characterizations of antipodal partial cubes
60 K. Diao, P. Zhao
More results on the smallest one-realization of a given set II
61 M. Hajian, N. Jafari Rad
Fair domination number in cactus graphs
62 H.S. Boregowda, B. Chaluvaraju, V.R. Kulli
The product connectivity banhatti index of a graph
63 J. Amjadi, S.M. Sheikholeslami, M. Soroudi
On the total Roman domination in trees
64 S. Cichacz, B. Freyberg, D. Froncek
Orientable Zn-distance magic graphs
65 Y. Huang, Z. Ouyang, J. Wang
The crossing number of the hexagonal graph H3,n
66 L. Volkmann
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number
67 R.A. Beeler, T.W. Haynes, K. Murphy
1-restricted optimal rubbling on graphs
68 B. Benmedjdoub, I. Bouchemakh, É. Sopena
2-distance colorings of integer distance graphs
69 A. Bickle, A. Schwenk
Minimum edge cuts in diameter 2 graphs
70 H. Jiang, X. Li, Y. Zhang
Erdõs-Gallai-type results for total monochromatic connection of graphs
71 H.A. Ahangar, J. Amjadi, M. Chellali, S. Nazari-Moghaddam, S.M. Sheikholeslami
Total Roman reinforcement in graphs
72 Y. Lan, Z. Qin, Y.T. Shi
The Turán number of 2P7
73 X. Chen, G. Hao, Z. Xie
A note on Roman domination of digraphs
74 R.C. Bunge, B.D. Darrow, T.M. Dubczuk, S. El-Zanati, H.H. Hao, G.L. Keller, G.A. Newkirk, D.P. Roberts
On decomposing the complete symmetric digraph into orientations of K4-e
75 M. Dettlaff, J. Raczek, J. Topp
Domination subdivision and domination multisubdivision numbers of graphs
76 G. Abrishami, M.A. Henning, F. Rahbarnia
On independent domination in planar, cubic graphs
77 C. Balbuena, H. Galeana-Sįnchez, M.-k. Guevara
About kernels, semikernels and Grundy functions in partial line digraphs
78 V. Taranchuk
Pancyclity when each cycle contains exactly k-chords

Your IP address: