The following pages link to Ebadollah S. Mahmoodian (Q322366):
Displaying 50 items.
- (Q234281) (redirect page) (← links)
- Sudoku rectangle completion (extended abstract) (Q322367) (← links)
- Balanced ternary designs with block size four (Q689427) (← links)
- The square chromatic number of the torus (Q898088) (← links)
- The spectrum of support sizes for threefold triple systems (Q917558) (← links)
- Silver cubes (Q1014825) (← links)
- Vertex domination of generalized Petersen graphs (Q1043959) (← links)
- BIB(9,18t,8t,4,3t) designs with repeated blocks (Q1094058) (← links)
- On defining numbers of vertex colouring of regular graphs (Q1292860) (← links)
- Defining sets and uniqueness in graph colorings: A survey (Q1299076) (← links)
- Eccentric sequences and triangle sequences of block designs (Q1322213) (← links)
- Numbers of common blocks in Mendelsohn and directed triple systems with repeated elements (Q1323536) (← links)
- Defining sets in vertex colorings of graphs and latin rectangles (Q1356483) (← links)
- Uniquely total colorable graphs (Q1376076) (← links)
- A new bound on the size of the largest critical set in a Latin square (Q1394806) (← links)
- On the simultaneous edge-coloring conjecture (Q1567288) (← links)
- On a conjecture of Keedwell and the cycle double cover conjecture (Q1567293) (← links)
- On the possible volumes of \(\mu\)-way Latin trades (Q1601715) (← links)
- The chromatic number of finite group Cayley tables (Q1732031) (← links)
- On the existence of \(3\)-way \(k\)-homogeneous Latin trades (Q1759386) (← links)
- On the size of the minimum critical set of a Latin square (Q1779489) (← links)
- Support sizes of sixfold triple systems (Q1801692) (← links)
- On the forced matching numbers of bipartite graphs (Q1827691) (← links)
- Multi-set designs and numbers of common triples (Q2366951) (← links)
- Forced orientation of graphs (Q2471507) (← links)
- Tight lower bounds on the size of a maximum matching in a regular graph (Q2478167) (← links)
- A computer algorithm for generating 3-designs by the method of trade off (Q2563620) (← links)
- On the chromatic number of Latin square graphs (Q2629269) (← links)
- (Q2712517) (← links)
- (Q2761069) (← links)
- (Q2869478) (← links)
- On the star arboricity of hypercubes (Q2876046) (← links)
- (Q2908697) (← links)
- On the construction of tree decompositions of hypercubes (Q2948819) (← links)
- (Q3089292) (← links)
- (Q3108603) (← links)
- On the existence of k-homogeneous Latin bitrades (Q3108621) (← links)
- On BIB designs with various support sizes forv = 9 and k=3 (Q3471546) (← links)
- A linear algebraic algorithm for reducing the support size of t-designs and to generate a basis for trades (Q3471552) (← links)
- (Q3636214) (← links)
- On Edge-Colorability of Cartesian Products of Graphs<sup>*</sup> (Q3927272) (← links)
- (Q3974688) (← links)
- (Q4016815) (← links)
- (Q4017155) (← links)
- (Q4033708) (← links)
- On Factors of a Graph (Q4094893) (← links)
- (Q4262241) (← links)
- (Q4347969) (← links)
- (Q4359574) (← links)
- (Q4405932) (← links)
