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

2 | M. Horņįk, J. HudįkOn the palette index of complete bipartite graphs |

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

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

5 | T. Han, R. Li Arc-disjont Hamiltonian cycles in round decomposable local tournaments |

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

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

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

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

10 | S. CockburnHomomorphic preimages of geometric paths |

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

68 | D. PilloneArankings of trees |

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

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

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

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

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

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

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

76 | R. Li , B. ShengThe second neighbourhood for bipartite tournaments |

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

Your IP address:192.168.142.190