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

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

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

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

5 | Z. Bi, G. Chartrand, P. ZhangAnother view of bipartite Ramsey numbers |

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

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

8 | P. Hrnčiar, G. MonoszovįHamiltonian and pancyclic graphs in the class of self-centered graphs with radius two |

9 | R. Ichishima, S.C. López , F.A. Muntaner-Batle, A. OshimaOn the beta-number of forests with isomorphic components |

10 | M. Edwards, G. MacGillivray, S. NasserasrReconfiguring minimum dominating sets: the γ-graph of a tree |

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

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

13 | Z. Dziechcińska-Halamoda, J. Górska, Z. Majcher, J. Michael, Z. SkupieńExtremal irregular digraphs |

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

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

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

17 | Z. StanięPertubations in a signed graph and its index |

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

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

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

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

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

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

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

25 | B. Bre¹ar, T.R. Hartinger, T. Kos, M. MilaničOn total domination in the Cartesian product of graphs |

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

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

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

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

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

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

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

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

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

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

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

37 | M. Horņįk, S. Jendrol', R. SotįkFacial incidence colorings of embedded multigraphs |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

58 | D. PilloneArankings of trees |

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

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

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

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

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

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

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

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

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

68 | B. Benmedjdoub, I. Bouchemakh, É. Sopena2-distance colorings of integer distance graphs |

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

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

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

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

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

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

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

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

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

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

Your IP address:192.168.142.190