The following pages link to (Q4432209):
Displaying 16 items.
- Orthogonal trades and the intersection problem for orthogonal arrays (Q293614) (← links)
- Silver block intersection graphs of Steiner 2-designs (Q354426) (← links)
- On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of \(t\)-designs (Q604662) (← links)
- Latin trades on three or four rows (Q856846) (← links)
- On defining numbers of circular complete graphs (Q864158) (← links)
- Silver cubes (Q1014825) (← links)
- Defining numbers in some of the Harary graphs (Q1023081) (← links)
- Constructing (0,1)-matrices with large minimal defining sets (Q1675656) (← links)
- Small surface trades in triangular embeddings (Q2433720) (← links)
- On the spectrum of minimal defining sets of full designs (Q2441344) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- On defining sets for projective planes (Q2576848) (← links)
- Greedy defining sets in graphs and Latin squares (Q3439453) (← links)
- Complete Forcing Numbers of Polyphenyl Systems (Q4617562) (← links)
- Defining Sets and Critical Sets in (0,1)‐Matrices (Q4929282) (← links)
- Determination of the size of defining set for Steiner triple systems (Q5059557) (← links)
