H. Assiyatun

From MaRDI portal
Person:850075

Available identifiers

zbMath Open assiyatun.hildaMaRDI QIDQ850075

List of research outcomes





PublicationDate of PublicationType
The dominating partition dimension and locating-chromatic number of graphs2023-12-16Paper
On Ramsey (C4, K1, n)-minimal graphs2023-07-04Paper
https://portal.mardi4nfdi.de/entity/Q50425402022-10-20Paper
Ramsey minimal graphs for a pair of a cycle on four vertices and an arbitrary star2022-06-14Paper
The connected size Ramsey number for matchings versus small disconnected graphs2021-08-23Paper
The Complete List of Ramsey (2K2,K4)-Minimal Graphs2021-08-16Paper
On The Total Edge and Vertex Irregularity Strength of Some Graphs Obtained from Star2020-12-29Paper
On The Locating-Chromatic Numbers of Subdivisions of Friendship Graph2020-12-29Paper
Calculating an upper bound of the locating-chromatic number of trees2020-01-16Paper
https://portal.mardi4nfdi.de/entity/Q52326542019-09-12Paper
On Ramsey \((4K_2,P_3)\)-minimal graphs2019-01-25Paper
Publisher correction to: ``Connected size Ramsey number for matchings vs. small stars or cycles2018-05-31Paper
Some infinite families of Ramsey \((P_{3},P_{n})\)-minimal trees2018-01-31Paper
Connected size Ramsey number for matchings vs. small stars or cycles2018-01-31Paper
The locating-chromatic number for Halin graphs2017-12-20Paper
https://portal.mardi4nfdi.de/entity/Q53672522017-10-12Paper
On Ramsey \((mK_2,H)\)-minimal graphs2017-06-29Paper
On the Ramsey numbers \(R(S_{2,m},K_{2,q})\) and \(R(sK_2,K_s+C_n)\).2016-05-04Paper
Total irregularity strength of three families of graphs2015-08-03Paper
On the locating-chromatic number of homogeneous lobsters2014-04-07Paper
The partition dimension for a subdivision of homogeneous caterpillars2014-04-07Paper
The locating-chromatic number for a subdivision of a wheel on one cycle edge2014-04-07Paper
The metric dimension of the lexicographic product of graphs2013-04-11Paper
The locating-chromatic number of firecracker graphs2012-11-09Paper
https://portal.mardi4nfdi.de/entity/Q30865712011-03-30Paper
THE RAMSEY NUMBER FOR A LINEAR FOREST VERSUS TWO IDENTICAL COPIES OF COMPLETE GRAPHS2011-03-25Paper
Path-path size multipartite Ramsey numbers2010-06-07Paper
https://portal.mardi4nfdi.de/entity/Q35659272010-06-07Paper
On Ramsey \((K_{1,2},P_4)\)-minimal graphs2010-05-31Paper
https://portal.mardi4nfdi.de/entity/Q35634462010-05-31Paper
https://portal.mardi4nfdi.de/entity/Q36261812009-05-22Paper
Ramsey Numbers on a Union of Identical Stars Versus a Small Cycle2009-01-13Paper
The Ramsey numbers for disjoint unions of graphs2008-11-12Paper
Ramsey \((K_{1,2}, C_4)\)-minimal graphs2008-08-12Paper
The Ramsey numbers for disjoint unions of trees2006-12-14Paper
3-star factors in random \(d\)-regular graphs2006-11-15Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54882822006-09-14Paper
On super \((a,d)\)-edge antimagic total labeling of disconnected graphs2006-09-14Paper
Creating new super edge-magic total labelings from old ones2006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q45266402001-01-25Paper

Research outcomes over time

This page was built for person: H. Assiyatun