Hilda Assiyatun

Orcid: 0000-0002-8296-2507

According to our database1, Hilda Assiyatun authored at least 26 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The dominating partition dimension and locating-chromatic number of graphs.
Electron. J. Graph Theory Appl., 2023

On Ramsey (C4, K1, n)-minimal graphs.
Electron. J. Graph Theory Appl., 2023

2022
Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star.
Electron. J. Graph Theory Appl., 2022

2020
Calculating an upper bound of the locating-chromatic number of trees.
Theor. Comput. Sci., 2020

2019
The connected size Ramsey number for matchings versus small disconnected graphs.
Electron. J. Graph Theory Appl., 2019

2018
On Ramsey (4K2, P3)-minimal graphs.
AKCE Int. J. Graphs Comb., 2018

2017
On Ramsey (mK<sub>2</sub>,H)-Minimal Graphs.
Graphs Comb., 2017

2015
Total Irregularity Strength of Three Families of Graphs.
Math. Comput. Sci., 2015

The complete list of Ramsey (2K<sub>2</sub>, K<sub>4</sub>)-minimal graphs.
Electron. J. Graph Theory Appl., 2015

On the Ramsey Numbers R(S<sub>2, m</sub>, K<sub>2, q</sub>) and R(sK<sub>2</sub>, K<sub>s</sub>+C<sub>n</sub>).
Ars Comb., 2015

On Unicyclic Ramsey (mK2, P<sub>3</sub>)-Minimal Graphs.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Locating-Chromatic Number of Binary Trees.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

An Upper Bound On the Total Vertex Irregularity Strength of the Cartesian Product of P<sub>2</sub> and an Arbitrary Regular Graph.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

On Ramsey Minimal Graphs for the Pair Paths.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

Connected Size Ramsey Numbers for Matchings versus Cycles or Paths.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge.
Proceedings of the 2nd International Conference of Graph Theory and Information Security, 2015

2013
The metric dimension of the lexicographic product of graphs.
Discret. Math., 2013

2011
On graph of order-n with the metric dimension n-3.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
The Ramsey Number for a Linear Forest versus Two identical Copies of Complete Graphs.
Discret. Math. Algorithms Appl., 2010

2009
Small maximal matchings of random cubic graphs.
J. Graph Theory, 2009

2008
The Ramsey numbers for disjoint unions of graphs.
Discret. Math., 2008

2007
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle.
Proceedings of the Computational Geometry and Graph Theory, 2007

2006
3-star factors in random <i>d</i>-regular graphs.
Eur. J. Comb., 2006

The Ramsey numbers for disjoint unions of trees.
Discret. Math., 2006

2003
Maximum Induced Matchings of Random Regular Graphs.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2000
Covering regular graphs with forests of small trees.
Australas. J Comb., 2000


  Loading...