Jirimutu

From MaRDI portal
Person:234879

Available identifiers

zbMath Open jirimutu.MaRDI QIDQ234879

List of research outcomes





PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q50047462021-08-03Paper
https://portal.mardi4nfdi.de/entity/Q51331062020-11-12Paper
Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles2020-04-22Paper
https://portal.mardi4nfdi.de/entity/Q52064072019-12-18Paper
https://portal.mardi4nfdi.de/entity/Q52347922019-10-02Paper
https://portal.mardi4nfdi.de/entity/Q51971422019-09-20Paper
https://portal.mardi4nfdi.de/entity/Q46412992018-05-25Paper
Some results on graceful graphs2016-12-01Paper
The generalized Petersen graph \(P (n, 7)\) is \((\frac{3n+6}{2}, 3)\)-antimagic2016-11-10Paper
Decomposing complete 3-uniform hypergraphs into cycles2016-10-06Paper
On the gracefulness of the digraph \(\overrightarrow{C_n} \times \overrightarrow{P_2}\)2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29929302016-08-10Paper
https://portal.mardi4nfdi.de/entity/Q31937282015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q51716972015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q29389792015-01-16Paper
A generalized DEA method based on cluster analysis with virtual unit2014-11-03Paper
https://portal.mardi4nfdi.de/entity/Q49803522014-06-30Paper
https://portal.mardi4nfdi.de/entity/Q54198602014-06-11Paper
ON A NOTE OF CYCLE-AXIOM OF HYPERGRAPHS2014-04-24Paper
Further study on sizes of acyclic hypergraphs2013-11-19Paper
Signed clique edge domination numbers of graphs2013-09-26Paper
On the gracefulness of the digraphs \(n-\overarrow{C}_{21}\)2013-07-12Paper
https://portal.mardi4nfdi.de/entity/Q49113352013-03-14Paper
https://portal.mardi4nfdi.de/entity/Q49047972013-01-31Paper
On the gracefulness of the digraphs \(n-\vec {C}_{m}\).2012-10-08Paper
https://portal.mardi4nfdi.de/entity/Q31086072012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31707102011-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30159852011-07-13Paper
https://portal.mardi4nfdi.de/entity/Q30117752011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q30041442011-05-31Paper
https://portal.mardi4nfdi.de/entity/Q30735562011-02-11Paper
https://portal.mardi4nfdi.de/entity/Q30590372010-12-08Paper
https://portal.mardi4nfdi.de/entity/Q34037722010-02-12Paper
https://portal.mardi4nfdi.de/entity/Q36215142009-04-21Paper
https://portal.mardi4nfdi.de/entity/Q54424202008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54373722008-01-18Paper
https://portal.mardi4nfdi.de/entity/Q57185252006-01-16Paper
https://portal.mardi4nfdi.de/entity/Q46626762005-03-30Paper
Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs2002-06-02Paper
Gracefulness of the diagraphs \(2k\cdot\overset\rightharpoonup C_5\) and \(2k\cdot\overset\rightharpoonup C_7\)2001-06-27Paper
https://portal.mardi4nfdi.de/entity/Q45211012001-01-14Paper

Research outcomes over time

This page was built for person: Jirimutu