The following pages link to Charles J. Colbourn (Q168193):
Displaying 50 items.
- (Q234534) (redirect page) (← links)
- Existence of optimal strong partially balanced 3-designs with block size four (Q264122) (← links)
- Quorums from difference covers (Q294779) (← links)
- Areas of triangles and Beck's theorem in planes over finite fields (Q313454) (← links)
- The existence of \((K_2\times K_6)\)-designs (Q367091) (← links)
- \(f\)-vectors of pure complexes and pure multicomplexes of rank three (Q394354) (← links)
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- Pasch trades with a negative block (Q409349) (← links)
- Fixed block configuration group divisible designs with block size six (Q409425) (← links)
- On the automorphisms of designs constructed from finite simple groups (Q494586) (← links)
- Electrical networks and Lie theory (Q500223) (← links)
- Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 (Q534044) (← links)
- Ovals and hyperovals in nets (Q557076) (← links)
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false (Q598476) (← links)
- The complexity of symmetrizing matrices (Q600245) (← links)
- Optical grooming with grooming ratio nine (Q616353) (← links)
- Generalizations and applications of the nowhere zero linear mappings in network coding (Q616419) (← links)
- Grooming traffic to minimize load (Q658091) (← links)
- Some progress on the existence of 1-rotational Steiner triple systems (Q663467) (← links)
- Wang tilings and distributed verification on anonymous torus networks (Q675863) (← links)
- Pairwise balanced designs with consecutive block sizes (Q676713) (← links)
- Existence of incomplete transversal designs with block size five and any index \(\lambda\) (Q676717) (← links)
- Blocking sets in \((v,\{ 2,4 \} ,1)\)-designs (Q676720) (← links)
- Piotrowski's infinite series of Steiner quadruple systems revisited (Q677178) (← links)
- From a \((G,k,1)\) to a \((C_ k\oplus G,k,1)\) difference family (Q679231) (← links)
- On resolvable difference families (Q679232) (← links)
- The existence of a simple 3-(28,5,30) design (Q685563) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- Efficient sets in partial \(k\)-trees (Q686252) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- Halving Steiner triple systems (Q686282) (← links)
- Existence results for doubly near resolvable \((v,3,2)\)-BIBDs (Q687116) (← links)
- Trails of triples in partial triple systems (Q690676) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- D-optimal designs with interaction coverage (Q715797) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Simple neighbourhoods in triple systems (Q749540) (← links)
- Neighbor designs and m-wheel systems (Q753362) (← links)
- Minimizing setups in ordered sets of fixed width (Q762183) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Embedding partial Steiner triple systems is NP-complete (Q787671) (← links)
- The complexity of completing partial Latin squares (Q793029) (← links)
- A census of regular 3-polystroma arising from honeycombs (Q793978) (← links)
- Recursive constructions for cyclic block designs (Q801917) (← links)
- Small embeddings of partial directed triple systems and partial triple systems with even \(\lambda\) (Q802563) (← links)
- Network reliability: Numbers or insight? (A discussion paper) (Q806808) (← links)
- Innovation networks. New approaches in modelling and analyzing. (Q838344) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Existence of BSAs and cyclic BSAs of block size three (Q872110) (← links)
