1 | D. D.-F. Liu, Z. Hu, K.-W. LihBounds on strong chromatic index of Halin graphs |

2 | S. Akbari, M. Motiei, S. Mozaffari, S. YazdanbodGraphs with total domatic number at least two |

3 | S.A. Aleid, J. Cáceres, M. Luz PuertasOn independent [1,2]-sets in trees |

4 | B. Amari, A. BerrachediGeneralized Hamming graphs: some new results |

5 | H. Aram, M. Atapour, S.M. SheikholeslamiEternal m-security bondage numbers in graphs |

6 | S. Arumugam, A. Godinho, T. SinghThe distance magic index od a graph |

7 | C. Barrientos, S. MinionOn the number of α-labeled graphs |

8 | U. Bednarz, I. WłochFibonacci and telephone numbers in extremal trees |

9 | S. Bermudo, J.C. Hernández-Gómez, J.M. SigarretaOn the total k-domination in graphs |

10 | M. Besson, B. TesmanT-span of directed wheel graphs_{R} |

11 | Z. Bi, G. Chartrand, P. ZhangAnother 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. IvanovaMore about the height of faces in 3-polytopes |

14 | O.V. Borodin, A.O. Ivanova, O.N. KazakDescribing neighborhoods in 3-polytopes with minimum degree 5 and without vertices of degree from 7 to 11 |

15 | Y.M. Borse, G. MundheGraphic and cographic Γ-extensionds of binary matroids |

16 | G. Boruzanli Ekinci, J.B. GauciThe super-connectivity of Kneser graphs |

17 | Y. Boudabbous, P. IlleThe {-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. WuOn edge colorings of 1-planar graphs without 5-cycles with two chords |

20 | M. Changat, F. Hossein Nezhad, H.M. Mulder, N. NarayananA note on the interval function of a disconnected graph |

21 | G. Chartrand, S. Devereaux, T.W. Haynes, S.T. Hedetniemi, P. ZhangRainbow disconnection in graphs |

22 | X. Chen, G. Hao, L. VolkmannBounds on the signed Roman k-domination number of a digraph |

23 | X. Chen, G. Hao, Z. XieA note on Roman domination of digraphs |

24 | S. Cichacz, A. GörlichConstant sum partition of sets integers and distance magic graphs |

25 | S. CockburnHomomorphic preimages of geometric paths |

26 | J. Cyman, M. Dettlaff, M.A. Henning, M. Lemańska, J. RaczekTotal domination in versus paired-domination in regular graphs |

27 | J. Czap, S. Jendrol', J. ValiskaConflict -free connections of graphs |

28 | Y.-P. Deng, H.-C. Wang, Y. ZhaoThe complexity od secure domination problem in graphs |

29 | W.J. Desormeaux, T.W. Haynes, M.A. HenningDomination parameters of a graph and its complement |

30 | A. Dong, X. ZhangEquitable 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. NasserasrReconfiguring minimum dominating sets: the γ-graph of a tree |

33 | H. Furmańczyk, M. Kubale, V. MkrtchyanEquitable colorings of corona multiproducts of graphs |

34 | Y. Gao, H. ZhangSharp upper bounds on the Clar number of Fullerene graphs |

35 | J.-X. Guan, J.-H. YinThe bipartite-splittance of a bipartite graph |

36 | I. Gutman, X. Li, Y. MaoInverse problem on the Steiner Wiener index |

37 | Sh. Haghi, H.R. MaimaniA 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. RautenbachHereditary equality of domination and exponential domination |

40 | A.M. Hinz, S. Varghese, A. VijayakumarPower domination in Knödel graphs and Hanoi graphs |

41 | X. HongCompletely independent spanning trees in k-th power of graphs |

42 | M. Horňák, J. HudákOn the palette index of complete bipartite graphs |

43 | M. Horňák, S. Jendrol', R. SotákFacial 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. WangThe 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. OshimaOn the beta-number of forests with isomorphic components |

47 | N. Jafari Rad, H. RahbaniBounds on the locating Roman dominating number in trees |

48 | N. Jafari Rad, H. RahbaniBounds on the locating-domination number and differentiating-total domination number in trees |

49 | N. Jafari Rad, H. RahbaniSome progress on the double Roman domination in graphs |

50 | R. Janczewski, A. Małafiejska , M. MałafiejskiOn incidence coloring of coloring of complete multipartite and semicubic bipartite graphs |

51 | L. Jin, G. Mazzuoccolo, E. SteffenCores, joins and the Fano-flow conjectures |

52 | Z. Jin, F. Li, Y. SunOn two generalized connectivities of graphs |

53 | Z. Jin, Y. Sun, J. TuRainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number |

54 | L. Kang, E. ShanTrees with unique least central subtrees |

55 | S. Kerdjoudj, A.V. Kostochka, A. RaspaudList star edge coloring of subcubic graphs |

56 | D. Kuziak, I. Peterin, I.G. YeroBounding the open k-monopoly number of strong product graphs |

57 | H. Li , B. Wu, W. YangMaking a dominating set of a graph connected |

58 | W. LiThe graphs whose permanental polynomials are symmetric |

59 | W. Li, X. Li, J. ZhangRainbow vertex-connection and forbidden subgraphs |

60 | X. Li, C. Magnant, M. Wei, X. ZhuGeneralized rainbow connection of graphs and their complements |

61 | Y.-X. Lin, X. WangCore index of perfect matching polytope for a 2-connected cubic graph |

62 | H. Liu, T. SousaTurán function and H-decomposition for GEM graphs |

63 | M. Lu, W. Ning , K. WangBounding the locating-total domination number of a tree in terms of its annihilation number |

64 | F. Ma, J. YanOn the number of disjoint 4-cycles in regular tournaments |

65 | N. Mandal, P. PanigrahiIrreducible no-hole L(2,1)-coloring of edge-multiplicity-paths-replacement graph |

66 | T.A. McKeeRequiring that minimal separators induce complete multipartite subgraphs |

67 | K. Mirzavaziri, M. Mirzavaziri, M.H. ShekarrizA characterization for 2-self-centered graphs |

68 | M.R. OboudiSome results on the independence polynomial of unicyclic graphs |

69 | I. Peterin, J. Schreyer, E. ©krabul'áková, A. TaranenkoA note on the Thue chromatic number of lexicographic produts of graphs |

70 | R. Rasi, S.M. SheikholeslamiThe smallest index of trees with given maximum degree |

71 | Y.T. Shi, J. TuAn efficient polynomial time approximation scheme for the vertex cover P problem on planar graphs_{3} |

72 | Z. StanićPertubations in a signed graph and its index |

73 | L. Sun , B. Wang, J.-L. WuTotal colorings of embedded graphs with maximum degree seven and without 3-cycles adjacent to 4-cycles |

74 | F. Wang, W. ZhaoMatchings extend to Hamiltonian cycles in 5-cube |

75 | L. Wang, Wang, K. XiangThe largest component in critical graphs |

76 | A.P. WojdaAlmost self-complementary uniform hypergraphs |

77 | L. ZhongThe minimum harmonic index for unicyclic graphs with given diameter |

Your IP address:192.168.142.65