E. S. Mahmoodian

From MaRDI portal
Person:322366

Available identifiers

zbMath Open mahmoodian.ebadollah-sDBLP86/5577WikidataQ5958859 ScholiaQ5958859MaRDI QIDQ322366

List of research outcomes





PublicationDate of PublicationType
Some applications of linear algebraic methods in combinatorics2023-08-21Paper
A study of $4-$cycle systems2023-08-21Paper
A Highly Symmetric Hamilton Decomposition for Hypercubes2020-04-06Paper
Decomposition of complete tripartite graphs into 5-cycles using the graph adjacency matrix2019-10-14Paper
On decomposing complete tripartite graphs into 5-cycles2019-07-14Paper
The chromatic number of finite group Cayley tables2019-03-15Paper
The four-way intersection problem for latin squares2018-07-12Paper
Sudoku rectangle completion (extended abstract)2016-10-14Paper
On the chromatic number of Latin square graphs2016-07-05Paper
The square chromatic number of the torus2015-12-08Paper
On the construction of tree decompositions of hypercubes2015-10-06Paper
On the star arboricity of hypercubes2014-08-15Paper
Possible volumes of t-(v, t + 1) Latin trades2014-02-19Paper
On decomposing complete tripartite graphs into 5-cycles2014-01-03Paper
Silver block intersection graphs of Steiner 2-designs2013-07-19Paper
A linear algebraic approach to orthogonal arrays and Latin squares2013-06-10Paper
Totally Silver Graphs2013-02-13Paper
On the existence of \(3\)-way \(k\)-homogeneous Latin trades2012-11-20Paper
On uniformly generating Latin squares2012-09-05Paper
On the existence of k-homogeneous Latin bitrades2012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31086032012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q30892922011-08-24Paper
Vertex domination of generalized Petersen graphs2009-12-10Paper
https://portal.mardi4nfdi.de/entity/Q36362142009-06-30Paper
Silver cubes2009-04-29Paper
https://portal.mardi4nfdi.de/entity/Q54491652008-03-11Paper
Forced orientation of graphs2008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54925912006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54926152006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54883732006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54609032005-07-20Paper
On the size of the minimum critical set of a Latin square2005-06-01Paper
On the spectrum of the forced matching number of graphs2004-10-15Paper
On the forced matching numbers of bipartite graphs2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44702342004-06-22Paper
https://portal.mardi4nfdi.de/entity/Q44322092004-01-25Paper
https://portal.mardi4nfdi.de/entity/Q48002702003-08-05Paper
A new bound on the size of the largest critical set in a Latin square2003-06-25Paper
https://portal.mardi4nfdi.de/entity/Q44059322003-06-24Paper
https://portal.mardi4nfdi.de/entity/Q48002722003-06-01Paper
The three-way intersection problem for Latin squares2002-10-09Paper
https://portal.mardi4nfdi.de/entity/Q45295042002-07-02Paper
On the possible volumes of \(\mu\)-way Latin trades2002-06-27Paper
A linear algebraic approach to directed designs2002-01-17Paper
A characterization of uniquely 2-list colorable graphs2001-12-17Paper
On a conjecture of Keedwell and the cycle double cover conjecture2001-11-28Paper
On the simultaneous edge-coloring conjecture2001-11-28Paper
https://portal.mardi4nfdi.de/entity/Q49432842000-09-05Paper
Defining sets and uniqueness in graph colorings: A survey2000-05-04Paper
https://portal.mardi4nfdi.de/entity/Q42622412000-01-02Paper
On defining numbers of vertex colouring of regular graphs1999-11-03Paper
Uniquely total colorable graphs1998-10-25Paper
https://portal.mardi4nfdi.de/entity/Q43595741998-01-15Paper
Defining sets in vertex colorings of graphs and latin rectangles1998-01-12Paper
A computer algorithm for generating 3-designs by the method of trade off1997-08-31Paper
https://portal.mardi4nfdi.de/entity/Q43479691997-08-12Paper
https://portal.mardi4nfdi.de/entity/Q48746041996-06-09Paper
https://portal.mardi4nfdi.de/entity/Q48589711996-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48589791996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48737961996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48490581996-02-20Paper
Numbers of common blocks in Mendelsohn and directed triple systems with repeated elements1995-02-14Paper
Eccentric sequences and triangle sequences of block designs1994-10-10Paper
Balanced ternary designs with block size four1993-12-05Paper
Multi-set designs and numbers of common triples1993-08-11Paper
Support sizes of sixfold triple systems1993-06-20Paper
https://portal.mardi4nfdi.de/entity/Q40337081993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40168151993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q40171551993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39746881992-06-25Paper
The spectrum of support sizes for threefold triple systems1990-01-01Paper
On BIB designs with various support sizes forv = 9 and k=31988-01-01Paper
BIB(9,18t,8t,4,3t) designs with repeated blocks1988-01-01Paper
A linear algebraic algorithm for reducing the support size of t-designs and to generate a basis for trades1987-01-01Paper
On Edge-Colorability of Cartesian Products of Graphs*1981-01-01Paper
On Factors of a Graph1977-01-01Paper

Research outcomes over time

This page was built for person: E. S. Mahmoodian