The following pages link to Nicholas J. Cavenagh (Q292252):
Displaying 50 items.
- Critical sets of full \(n\)-Latin squares (Q292254) (← links)
- (Q331491) (redirect page) (← links)
- Critical sets of 2-balanced Latin rectangles (Q331492) (← links)
- Longest partial transversals in plexes (Q404534) (← links)
- Decomposing complete equipartite graphs into odd square-length cycles: number of parts even (Q418858) (← links)
- Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems (Q442344) (← links)
- On the distances between Latin squares and the smallest defining set size (Q510525) (← links)
- Multi-Latin squares (Q539869) (← links)
- Decomposing complete tripartite graphs into 5-cycles when the partite sets have similar size (Q657830) (← links)
- Mutually orthogonal binary frequency squares (Q782946) (← links)
- Edge-magic group labellings of countable graphs (Q870009) (← links)
- When is a partial Latin square uniquely completable, but not its completable product? (Q924972) (← links)
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts (Q960919) (← links)
- On the number of transversals in Cayley tables of cyclic groups (Q968119) (← links)
- Latin bitrades derived from groups (Q998355) (← links)
- Sparse graphs which decompose into closed trails of arbitrary lengths (Q1015428) (← links)
- On completing three cyclically generated transversals to a Latin square (Q1017414) (← links)
- Path and cycle decompositions of complete equipartite graphs: Four parts (Q1025923) (← links)
- Latin trades in groups defined on planar triangulations (Q1043843) (← links)
- Balanced diagonals in frequency squares (Q1637145) (← links)
- Constructing (0,1)-matrices with large minimal defining sets (Q1675656) (← links)
- (Q1826943) (redirect page) (← links)
- On a generalization of the Oberwolfach problem (Q1826944) (← links)
- Further decompositions of complete tripartite graphs into 5-cycles (Q1849912) (← links)
- Constructing and deconstructing Latin trades (Q1876678) (← links)
- Induced subarrays of Latin squares without repeated symbols (Q1953431) (← links)
- Decomposing complete equipartite graphs into short odd cycles (Q1960284) (← links)
- Decompositions of complete multipartite graphs into cycles of even length (Q1972321) (← links)
- Decomposing dense bipartite graphs into 4-cycles (Q2260624) (← links)
- Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \) (Q2305901) (← links)
- Maximal partial Latin cubes (Q2341074) (← links)
- Latin squares with no transversals (Q2363108) (← links)
- Subcubic trades in Steiner triple systems (Q2400566) (← links)
- Orthogonal trades in complete sets of MOLS (Q2401395) (← links)
- Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs (Q2413623) (← links)
- Planar Eulerian triangulations are equivalent to spherical Latin bitrades (Q2469205) (← links)
- Minimal homogeneous Steiner 2-\((v,3)\) trades (Q2470439) (← links)
- Minimal homogeneous Latin trades (Q2501541) (← links)
- 3-homogeneous Latin trades (Q2570103) (← links)
- Maximal sets of mutually orthogonal frequency squares (Q2657141) (← links)
- Row-column factorial designs with strength at least 2 (Q2701034) (← links)
- Nonextendible Latin Cuboids (Q2902899) (← links)
- (Q2918401) (← links)
- THERE ARE ASYMPTOTICALLY THE SAME NUMBER OF LATIN SQUARES OF EACH PARITY (Q2986528) (← links)
- (Q3025222) (← links)
- Decomposing complete equipartite graphs into short even cycles (Q3084613) (← links)
- Near-automorphisms of Latin squares (Q3100731) (← links)
- (Q3114964) (← links)
- (Q3166115) (← links)
- (Q3392762) (← links)
