1 | Y. Boudabbous, P. IlleThe {-2,-1}-selfdual and decomposable tournaments |

2 | A. Dong, X. ZhangEquitable coloring and equitable choosability of graphs with small maximum average degree |

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

4 | Z. Ding, Y. HuangThe crossing numbers of join of some graphs with n isolated vertices |

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

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

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

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

9 | H. Cai, Z.Y. Luo, D. Sun , L. Sun , J.-L. WuOn edge colorings of 1-planar graphs without 5-cycles with two chords |

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

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

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

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

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

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

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

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

18 | M. Horňák, S. Jendrol', R. SotákFacial incidence colorings of embedded multigraphs |

19 | S. Wang, G. ZhangArc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity |

20 | Y. SakamotoHamilton cycles in double generalized Petersen graphs |

21 | H. Ren , C. YangNew formulae for the decycling number of graphs |

22 | S. Bhoumik, S. MitraL(2,1) labeling of circulant graphs |

23 | R. J. Gould, P. Horn, M.S. Jacobson, B.J. ThomasGaps in the saturation spectrum of trees |

24 | T.M. LewisOn the Hamiltonian number of a planar graph |

25 | R.-X. Hao, Y. YuanIndependence number, connectivity and all fractional (a,b,k)-critical graphs |

26 | C. Duffy, G. MacGillivray, P. Ochem, A. RaspaudOriented incidence colourings of digraphs |

27 | J. Dybizbański, A. NencaOriented chromatic number of Cartesian products and strong products of paths |

28 | W. Goddard, R. Melville, H. XuAlmost injective colorings |

29 | Y.M. Borse, S.R. ShaikhDecomposition of the product of cycles based on the degree partition |

30 | R.K. YehPair L(2,1)-labelings of infinite graphs |

31 | D.B. West, J.I. WiseAntipodal edge-colorings of hypercubes |

32 | I. Gorgol, A. Lechowska Anti-Ramsey number of Hanoi graphs |

33 | M. Benatallah, N. Ikhlef- Eschouf, M. MihoubiOn the b-domatic number of graphs |

34 | M. Rajeswari, I. Sahul HamidGlobal dominator coloring of graphs |

35 | R. Bailey, I.G. YeroError-correcting codes from k-resolving sets |

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

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

38 | S. ©pacapanOn 3-colorings of direct products of graphs |

39 | X. Liu, Z. Shao, S.M. Sheikholeslami, M. Soroudi, L. VolkmannOn the co-Roman domination in graphs |

40 | D. PilloneArankings of trees |

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

42 | K. Diao, P. Zhao More results on the smallest one-realization of a given set II |

43 | M. Hajian, N. Jafari RadFair domination number in cactus graphs |

44 | H.S. Boregowda, B. Chaluvaraju, V.R. KulliThe product connectivity banhatti index of a graph |

45 | J. Amjadi, S.M. Sheikholeslami, M. SoroudiOn the total Roman domination in trees |

46 | S. Cichacz, B. Freyberg, D. FroncekOrientable Z-distance magic graphs_{n} |

47 | Y. Huang, Z. Ouyang, J. WangThe crossing number of the hexagonal graph H_{3,n} |

48 | L. VolkmannSufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number |

49 | R.A. Beeler, T.W. Haynes, K. Murphy1-restricted optimal rubbling on graphs |

50 | J. Harant, S. MohrOn Selkow's bound on the independence number of graphs |

51 | A. Bickle, A. SchwenkMinimum edge cuts in diameter 2 graphs |

52 | H. Jiang, X. Li, Y. ZhangErdős-Gallai-type results for total monochromatic connection of graphs |

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

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

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

56 | R.C. Bunge, B.D. Darrow, T.M. Dubczuk, S. El-Zanati, H.H. Hao, G.L. Keller, G.A. Newkirk, D.P. RobertsOn decomposing the complete symmetric digraph into orientations of K_{4}-e |

57 | M. Dettlaff, J. Raczek, J. ToppDomination subdivision and domination multisubdivision numbers of graphs |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

76 | 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 |

Your IP address:192.168.142.190