The following pages link to (Q3728911):
Displaying 9 items.
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291) (← links)
- Existence results for doubly near resolvable \((v,3,2)\)-BIBDs (Q687116) (← links)
- On the Bays-Lambossy theorem (Q908921) (← links)
- A construction of cyclic Steiner triple systems of order \(p^ n\) (Q1097888) (← links)
- The strong chromatic number of partial triple systems (Q1101122) (← links)
- A parallelization of Miller's \(n^{\log n}\) isomorphism technique (Q1198063) (← links)
- The 1-rotational Kirkman triple systems of order 33 (Q1569861) (← links)
- Finding regular subgraphs in both arbitrary and planar graphs (Q1923612) (← links)
- A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares (Q3029017) (← links)
