Accepted papers

1 D. D.-F. Liu, Z. Hu, K.-W. Lih
Bounds on strong chromatic index of Halin graphs
2 S. Akbari, M. Motiei, S. Mozaffari, S. Yazdanbod
Graphs with total domatic number at least two
3 S.A. Aleid, J. Cáceres, M. Luz Puertas
On independent [1,2]-sets in trees
4 B. Amari, A. Berrachedi
Generalized Hamming graphs: some new results
5 H. Aram, M. Atapour, S.M. Sheikholeslami
Eternal m-security bondage numbers in graphs
6 S. Arumugam, A. Godinho, T. Singh
The distance magic index od a graph
7 C. Barrientos, S. Minion
On the number of α-labeled graphs
8 U. Bednarz, I. Włoch
Fibonacci and telephone numbers in extremal trees
9 S. Bermudo, J.C. Hernández-Gómez, J.M. Sigarreta
On the total k-domination in graphs
10 M. Besson, B. Tesman
TR-span of directed wheel graphs
11 Z. Bi, G. Chartrand, P. Zhang
Another view of bipartite Ramsey numbers
12 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
13 O.V. Borodin, M.A. Bykov, A.O. Ivanova
More about the height of faces in 3-polytopes
14 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
15 Y.M. Borse, G. Mundhe
Graphic and cographic Γ-extensionds of binary matroids
16 G. Boruzanli Ekinci, J.B. Gauci
The super-connectivity of Kneser graphs
17 Y. Boudabbous, P. Ille
The {-2,-1}-selfdual and decomposable tournaments
18 B. Breąar, T.R. Hartinger, T. Kos, M. Milanič
On total domination in the Cartesian product of graphs
19 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
20 M. Changat, F. Hossein Nezhad, H.M. Mulder, N. Narayanan
A note on the interval function of a disconnected graph
21 G. Chartrand, S. Devereaux, T.W. Haynes, S.T. Hedetniemi, P. Zhang
Rainbow disconnection in graphs
22 X. Chen, G. Hao, L. Volkmann
Bounds on the signed Roman k-domination number of a digraph
23 X. Chen, G. Hao, Z. Xie
A note on Roman domination of digraphs
24 S. Cichacz, A. Görlich
Constant sum partition of sets integers and distance magic graphs
25 S. Cockburn
Homomorphic preimages of geometric paths
26 J. Cyman, M. Dettlaff, M.A. Henning, M. Lemańska, J. Raczek
Total domination in versus paired-domination in regular graphs
27 J. Czap, S. Jendrol', J. Valiska
Conflict -free connections of graphs
28 Y.-P. Deng, H.-C. Wang, Y. Zhao
The complexity od secure domination problem in graphs
29 W.J. Desormeaux, T.W. Haynes, M.A. Henning
Domination parameters of a graph and its complement
30 A. Dong, X. Zhang
Equitable coloring and equitable choosability of graphs with small maximum average degree
31 Z. Dziechcińska-Halamoda, J. Górska, Z. Majcher, J. Michael, Z. Skupień
Extremal irregular digraphs
32 M. Edwards, G. MacGillivray, S. Nasserasr
Reconfiguring minimum dominating sets: the γ-graph of a tree
33 H. Furmańczyk, M. Kubale, V. Mkrtchyan
Equitable colorings of corona multiproducts of graphs
34 Y. Gao, H. Zhang
Sharp upper bounds on the Clar number of Fullerene graphs
35 J.-X. Guan, J.-H. Yin
The bipartite-splittance of a bipartite graph
36 I. Gutman, X. Li, Y. Mao
Inverse problem on the Steiner Wiener index
37 Sh. Haghi, H.R. Maimani
A note on the Ramsey number of even wheels versus stars
38 T. Han, R. Li
Arc-disjont Hamiltonian cycles in round decomposable local tournaments
39 M.A. Henning, S. Jäger, D. Rautenbach
Hereditary equality of domination and exponential domination
40 A.M. Hinz, S. Varghese, A. Vijayakumar
Power domination in Knödel graphs and Hanoi graphs
41 X. Hong
Completely independent spanning trees in k-th power of graphs
42 M. Horňák, J. Hudák
On the palette index of complete bipartite graphs
43 M. Horňák, S. Jendrol', R. Soták
Facial incidence colorings of embedded multigraphs
44 P. Hrnčiar, G. Monoszová
Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
45 Y.Q Huang, Z. Ouyang, J. Wang
The crossing number of join of the generalized Petersen graph P(3,1) with path and cycle
46 R. Ichishima, S.C. López , F.A. Muntaner-Batle, A. Oshima
On the beta-number of forests with isomorphic components
47 N. Jafari Rad, H. Rahbani
Bounds on the locating Roman dominating number in trees
48 N. Jafari Rad, H. Rahbani
Bounds on the locating-domination number and differentiating-total domination number in trees
49 N. Jafari Rad, H. Rahbani
Some progress on the double Roman domination in graphs
50 R. Janczewski, A. Małafiejska , M. Małafiejski
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
51 L. Jin, G. Mazzuoccolo, E. Steffen
Cores, joins and the Fano-flow conjectures
52 Z. Jin, F. Li, Y. Sun
On two generalized connectivities of graphs
53 Z. Jin, Y. Sun, J. Tu
Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number
54 L. Kang, E. Shan
Trees with unique least central subtrees
55 S. Kerdjoudj, A.V. Kostochka, A. Raspaud
List star edge coloring of subcubic graphs
56 D. Kuziak, I. Peterin, I.G. Yero
Bounding the open k-monopoly number of strong product graphs
57 H. Li , B. Wu, W. Yang
Making a dominating set of a graph connected
58 W. Li
The graphs whose permanental polynomials are symmetric
59 W. Li, X. Li, J. Zhang
Rainbow vertex-connection and forbidden subgraphs
60 X. Li, C. Magnant, M. Wei, X. Zhu
Generalized rainbow connection of graphs and their complements
61 Y.-X. Lin, X. Wang
Core index of perfect matching polytope for a 2-connected cubic graph
62 H. Liu, T. Sousa
Turán function and H-decomposition for GEM graphs
63 M. Lu, W. Ning , K. Wang
Bounding the locating-total domination number of a tree in terms of its annihilation number
64 F. Ma, J. Yan
On the number of disjoint 4-cycles in regular tournaments
65 N. Mandal, P. Panigrahi
Irreducible no-hole L(2,1)-coloring of edge-multiplicity-paths-replacement graph
66 T.A. McKee
Requiring that minimal separators induce complete multipartite subgraphs
67 K. Mirzavaziri, M. Mirzavaziri, M.H. Shekarriz
A characterization for 2-self-centered graphs
68 M.R. Oboudi
Some results on the independence polynomial of unicyclic graphs
69 I. Peterin, J. Schreyer, E. ©krabul'áková, A. Taranenko
A note on the Thue chromatic number of lexicographic produts of graphs
70 R. Rasi, S.M. Sheikholeslami
The smallest index of trees with given maximum degree
71 Y.T. Shi, J. Tu
An efficient polynomial time approximation scheme for the vertex cover P3 problem on planar graphs
72 Z. Stanić
Pertubations in a signed graph and its index
73 L. Sun , B. Wang, J.-L. Wu
Total colorings of embedded graphs with maximum degree seven and without 3-cycles adjacent to 4-cycles
74 F. Wang, W. Zhao
Matchings extend to Hamiltonian cycles in 5-cube
75 L. Wang, Wang, K. Xiang
The largest component in critical graphs
76 A.P. Wojda
Almost self-complementary uniform hypergraphs
77 L. Zhong
The minimum harmonic index for unicyclic graphs with given diameter

Your IP address: