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

2 | M. Hajian, N. Jafari RadA note on the fair domination number in outerplanar graphs |

3 | T. Madaras, P. ©iroczkiMinimal graphs with respect to geometric distance realizability |

4 | I. Gutman, H. Hua, H. WangComparing eccentricity-based graph invariants |

5 | D.V. KarpovLarge contractible subgraphs of a 3-connected graph |

6 | M. Krnc, J.-S. Sereni, R. ©krekovski, Z.B. YilmaEccentricity of networks with structural constraints |

7 | W.F. Klostermeyer, M.E. Messinger, A. YeoDominating vertex covers: a searchlight problem |

8 | G.C. Lau, H.-K. Ng, W.C. ShiuOn local magic chromatic number of cycle-related join graphs |

9 | N.R. Aravind, C.R. SubramanianIntersection dimension and graph invariants |

10 | L. Wang, W. Wide³, W. ZhengOn implicit heavy subgraphs and Hamiltonicity of 2-connected graphs |

11 | Y. Huang, Y. WangThe crossing number of Cartesian product of 5-wheels with any tree |

12 | A. Kemnitz, M. Marangio, M. VoigtGeneralized sum list colorings of graphs |

13 | L. Hu, L. Sun, J.-L. WuList coloring of planar graphs without 6-cycles with two chords |

14 | A.C. Martínez, I. Peterin, I.G. YeroIndependent transversal total domination versus total domination in trees |

15 | B. Bre¹ar, Cs. Bujtás, T. Gologranc, S. Klav¾ar, G. Ko¹mrlj, T. Marc, B. Patkós, Zs. Tuza, M. VizerOn Grundy total domination number in product graphs |

16 | P. Paulraja, R. SrimathiDecomposition of the tensor product of graphs into cycles of lengths 3 and 6 |

17 | A. Cabrera Martínez, D. Kuziak, I.G. YeroA constructive characterization of vertex cover Roman trees |

18 | E.T. Baskoro, D.R. Silaban, S. UttunggadewaOn the restricted size Ramsey number involving path |

19 | J. Cyman, M.A. Henning, J. ToppOn accurate domination in graphs |

Your IP address:192.168.142.190