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 S. Arumugam, A. Godinho, T. Singh
The distance magic index od a graph
6 L. Asgharsharghi, S.M. Sheikholeslami
Signed total Roman edge domination number
7 F. Ashraf, M. Bača, M. Lascsáková, A. Semaničová-Feňovčiková
On H-irregularity strength of graphs
8 M. Atapour, N. Dehgardi
Twin minus total domination numbers in directed graphs
9 C. Barrientos, S. Minion
On the number of α-labeled graphs
10 U. Bednarz, I. Włoch
Fibonacci and telephone numbers in extremal trees
11 S. Bermudo, J.C. Hernández-Gómez, J.M. Sigarreta
On the total k-domination in graphs
12 M. Besson, B. Tesman
TR-span of directed wheel graphs
13 Z. Bi, G. Chartrand, P. Zhang
Another view of bipartite Ramsey numbers
14 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
15 O.V. Borodin, M.A. Bykov, A.O. Ivanova
More about the height of faces in 3-polytopes
16 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
17 Y.M. Borse, G. Mundhe
Graphic and cographic Γ-extensionds of binary matroids
18 G. Boruzanli Ekinci, J.B. Gauci
The super-connectivity of Kneser graphs
19 Y. Boudabbous, P. Ille
The {-2,-1}-selfdual and decomposable tournaments
20 M. Changat, F. Hossein Nezhad, H.M. Mulder, N. Narayanan
A note on the interval function of a disconnected graph
21 X. Chen, G. Hao, Z. Xie
A note on Roman domination of digraphs
22 S. Cichacz, A. Görlich
Constant sum partition of sets integers and distance magic graphs
23 S. Cockburn
Homomorphic preimages of geometric paths
24 J. Cyman, M. Dettlaff, M.A. Henning, M. Lemańska, J. Raczek
Total domination in versus paired-domination in regular graphs
25 J. Czap, S. Jendrol', J. Valiska
Conflict -free connections of graphs
26 Y.-P. Deng, H.-C. Wang, Y. Zhao
The complexity od secure domination problem in graphs
27 W.J. Desormeaux, T.W. Haynes, M.A. Henning
Domination parameters of a graph and its complement
28 A. Dong, X. Zhang
Equitable coloring and equitable choosability of graphs with small maximum average degree
29 E. Duchene, H. Kheddouci, M.-A. Tahraoui, M. WoĽniak
Labeled embedding of (n,n-2)-graphs in their complements
30 Z. Dziechcińska-Halamoda, J. Górska, Z. Majcher, J. Michael, Z. Skupień
Extremal irregular digraphs
31 M. Edwards, G. MacGillivray, S. Nasserasr
Reconfiguring minimum dominating sets: the γ-graph of a tree
32 H. Furmańczyk, M. Kubale, V. Mkrtchyan
Equitable colorings of corona multiproducts of graphs
33 Y. Gao, H. Zhang
Sharp upper bounds on the Clar number of Fullerene graphs
34 A.P. Godbole, E. Kelley, E. Kurtz, P. Prałat, Y. Zhang
The total acquisition number of the randomly weighted path
35 S. Gravier, É. Vandomme
Constant 2-labellings and an application to (r,a,b)-covering codes
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 M. Hajian, N. Jafari Rad
On the Roman domination stable graphs
39 R. Hammack, D. T. Taylor
Proper connection of direct products
40 T. Han, R. Li
Arc-disjont Hamiltonian cycles in round decomposable local tournaments
41 M.A. Henning, S. Jäger, D. Rautenbach
Hereditary equality of domination and exponential domination
42 A.M. Hinz, S. Varghese, A. Vijayakumar
Power domination in Knödel graphs and Hanoi graphs
43 X. Hong
Completely independent spanning trees in k-th power of graphs
44 M. Horňák, J. Hudák
On the palette index of complete bipartite graphs
45 P. Hrnčiar, G. Monoszová
Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
46 J. Huang, S.C. Li
On the spectral characterizations of graphs
47 Y.Q Huang, Z. Ouyang, J. Wang
The crossing number of join of the generalized Petersen graph P(3,1) with path and cycle
48 R. Ichishima, S.C. López , F.A. Muntaner-Batle, A. Oshima
On the beta-number of forests with isomorphic components
49 N. Jafari Rad, H. Rahbani
Bounds on the locating Roman dominating number in trees
50 N. Jafari Rad, H. Rahbani
Bounds on the locating-domination number and differentiating-total domination number in trees
51 R. Janczewski, A. Małafiejska , M. Małafiejski
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
52 L. Jin, G. Mazzuoccolo, E. Steffen
Cores, joins and the Fano-flow conjectures
53 Z. Jin, F. Li, Y. Sun
On two generalized connectivities of graphs
54 L. Kang, E. Shan
Trees with unique least central subtrees
55 E. Konstantinova
Chromatic properties of the Pancake 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 F. Ma, J. Yan
On the number of disjoint 4-cycles in regular tournaments
64 N. Mandal, P. Panigrahi
Irreducible no-hole L(2,1)-coloring of edge-multiplicity-paths-replacement graph
65 T.A. McKee
Requiring that minimal separators induce complete multipartite subgraphs
66 K. Mirzavaziri, M. Mirzavaziri, M.H. Shekarriz
A characterization for 2-self-centered graphs
67 M.R. Oboudi
Some results on the independence polynomial of unicyclic graphs
68 I. Peterin, J. Schreyer, E. ©krabul'áková, A. Taranenko
A note on the Thue chromatic number of lexicographic produts of graphs
69 R. Rasi, S.M. Sheikholeslami
The smallest index of trees with given maximum degree
70 Z. Stanić
Pertubations in a signed graph and its index
71 Y. Sun
A sharp lower bound for generalized 3-edge-connectivity of strong product graphs
72 F. Wang, W. Zhao
Matchings extend to Hamiltonian cycles in 5-cube
73 L. Wang, Wang, K. Xiang
The largest component in critical graphs
74 A.P. Wojda
Almost self-complementary uniform hypergraphs
75 J. Wu, T. Zhang, S. Zhou
The existence of P≥ 3-factor covered graphs
76 T. Wu, H. Zhang
Per-spectral characterizations of some bipartite graphs
77 L. Zhong
The minimum harmonic index for unicyclic graphs with given diameter

Your IP address: