1 | N. Haghparast, D. KianiEdge-connectivity and edges of even factors of graphs |

2 | Y. MandelshtamOn graphs presentable by pattern-avoiding words |

3 | H.A. Ahangar, J. Amjadi, M. Chellali, S. Nazari-Moghaddam, S.M. SheikholeslamiTotal Roman reinforcement in graphs |

4 | Y. Lan, Z. Qin, Y.T. ShiThe Turán number of 2P_{7} |

5 | G. Abrishami, M.A. Henning, F. RahbarniaOn independent domination in planar, cubic graphs |

6 | C. Balbuena, H. Galeana-Sánchez, M.-k. GuevaraAbout kernels, semikernels and Grundy functions in partial line digraphs |

7 | V. TaranchukPancyclity when each cycle contains exactly k-chords |

8 | X. Li, X. ZhuKaleidoscopic edge-coloring of complete graphs and r-regular graphs |

9 | A.T. Elakkiya, A. MuthusamyGregarious kite factorization of tensor product of complete graphs |

10 | R. Ramamurthi, G. SandersStar coloring outerplanar bipartite graphs |

11 | A.S. Jobson, A.E. Kézdy, J. Lehel, G. MészárosThe path -pairability number of products of stars |

12 | S. Wang, L. XiongOn the independence number of traceable 2-connected claw-free graphs |

13 | G.-X. Cai, Y.Z Fan, Y. Fang, G.-D. YuSpectral radius and Hamiltonicity of graphs |

14 | M. Lu, W. Ning , K. WangBounds on the locating-total domination number in trees |

15 | S. Jendrol', X. Li, Y. Mao, Y. Zhang, H. Zhao, X. ZhuConflict-free vertex-connections of graphs |

16 | T. VetrikOn the metric dimension of directed and undirected circulant graphs |

17 | L. Tang, E. VumarA note on cycles in locally Hamiltonian and locally Hamilton-connected graphs |

18 | T. Tian, L. Xiong2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices |

19 | V. Coll, J. Hook, C. Magnant, K. McCready, K. RyanThe proper diameter of a graph |

20 | O. Hudry, A. LobsteinThe compared costs of domination, location-domination and identification |

21 | Z.R. BogdanowiczOn the minimum number of spanning trees in cubic multigraphs |

22 | L. Feng, M. Liu, Liu, P. ZhangSpectral conditions for graphs to be k-hamiltonian or k-path-coverable |

23 | F. Ashraf, M. Bača, S.C. López , F.A. Muntaner-Batle, A. Oshima, A. Semaničová-FeňovčikováOn total H-irregularity strength of the disjoint union of graphs |

24 | M. Fürst, D. RautenbachA short proof for a lower bound on the zero forcing number |

25 | L. Kang, E. Shan, M. ZhaoDomination in the generalized Petersen graphs |

26 | X. Li, L. WangDeficiency and forbidden subgraphs of connected , locally-connected graphs |

27 | D. Amos, J. Asplund, B. Brimkov, R. DavilaThe Slater and sub-k-domination number of a graph with applications to domination and k-domination |

28 | Y. ZhaoMore on the minimum size of graphs with given rainbow index |

29 | E. Cheng, L.-H. Hsu, C.-N. Hung, M.-C. Yang2-spanning cyclability problems of the some generalized Petersen graphs |

30 | C. Xu, X. ZhaoNeighbor sum distinguishing total chromatic number of planar graphs without 5-cycles |

31 | J. Czap, S. Jendrol', P. ©ugerek, J. ValiskaFacial [r.s,t]-colorings of plane graphs |

32 | D.A. Mojdeh, A. Moradi, O. SharifiRoman 2-bondage number of a graph |

33 | I. Fabrici, J. Harant, S. Mohr, J.M. SchmidtLonger cycles in essentially 4-connected planar graphs |

34 | M. Sonntag, H.-M. TeichertNiche hypergraphs of products of digraphs |

35 | A. Arockiaraj, S. Klavľar, P. Manuel, E. Thomas, A. XavierStrong geodetic problems in networks |

36 | W.-H Lu, H. Ren , C. YangLower bound on the number of Hamiltonian cycles of generalized Petersen graphs |

37 | B. VučkovićAn improved upper bound on neighbor expanded sum distinguishing index |

38 | L.-Y. Miao, W.-Y. SongNeighbor sum distinguishing total choosability of IC-planar graphs |

39 | R. Davila, M.A. HenningTotal forcing sets and zero forcing sets in trees |

40 | T.W. Haynes, M.A. HenningGraphs with large semipared domination number |

41 | N. PolatOn some properties of antipodal partial cubes |

42 | I. GorgolA note on lower bound for induced Ramsey numbers |

43 | M. Blidia, A. Bouchou, M. ChellaliExtremal graphs foe a bound on the Roman domination number |

44 | F. Kardoą, M. Maceková, M. Mockovčiaková, É. Sopena, R. SotákIncidence coloring-cold cases |

45 | S.-S. Li, J.-H. YinOn factorable bigraphic pairs |

46 | P. KaemawichanuratHamiltonicity of double domination critical claw-free graphs |

47 | A. Bernshteyn, O. Khormali, R.R. Martin, J. Rollin, D. Rorabaugh, S. Shan, A. UzzellRegular colorings in regular graphs |

48 | Y. Hu, Y.T. Shi, Y. WeiThe edit distance function of some graphs |

49 | Z.-C. Chen, H.-C. LeeDecomposing the complete graph into Hamiltonian paths (cycles) and 3-stars |

50 | M. Fürst, M. Gentner, M.A. Henning, S. Jäger, D. RautenbachEquating k maximum degrees in graphs without short cycles |

51 | A. Brandt, J. Diemunsch, S. JahanbekamAdditive list coloring of planar graphs with given girth |

Your IP address:192.168.142.190