49 results on '"Colbourn, Charles J."'
Search Results
2. Egalitarian Steiner quadruple systems of doubly even order
3. Cover starters for covering arrays of strength two
4. Grooming traffic to minimize load
5. Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
6. Optical grooming with grooming ratio nine
7. Graph designs for the eight-edge five-vertex graphs
8. Minimum embedding of Steiner triple systems into [formula omitted]-designs II
9. Fully gated graphs: Recognition and convex operations
10. Constructing strength three covering arrays with augmented annealing
11. Strength two covering arrays: Existence tables and projection
12. Directed complete bipartite graph decompositions: Indirect constructions
13. Constructions of optimal orthogonal arrays with repeated rows
14. Embedding path designs into kite systems
15. Ovals and hyperovals in nets
16. Grooming in unidirectional rings: K4− e designs
17. Optimal ( n,4,2)-OOC of small orders
18. Graph decompositions with application to wavelength add-drop multiplexing for minimizing SONET ADMs
19. Modified group divisible designs with block size four
20. Kirkman school project designs
21. f-vectors of pure complexes and pure multicomplexes of rank three
22. Minimum embedding of Steiner triple systems into [formula omitted]-designs I
23. Optical grooming with grooming ratio nine
24. Minimum embedding of Steiner triple systems into (K4−e)-designs II
25. Minimum embedding of Steiner triple systems into (K4-e)-designs I
26. Grooming in unidirectional rings: K4−e designs
27. Preface
28. -vectors of pure complexes and pure multicomplexes of rank three.
29. Tight 4-factor orthogonal main effect plans
30. Completing the spectrum of rotational Mendelsohn triple systems
31. Concerning difference families with block size four
32. Support sizes of sixfold triple systems
33. Reliable assignments of processors to tasks and factoring on matroids
34. Directed star decompositions of directed multigraphs
35. Intersections and supports of quadruple systems
36. The fine structure of threefold triple systems: υ ≡ 1 or 3 (mod 6)
37. Unit disk graphs
38. Permutation graphs: Connected domination and Steiner trees
39. The spectrum of support sizes for threefold triple systems
40. On two dual classes of planar graphs
41. Grooming in unidirectional rings: <f>K4-e</f> designs
42. Minimum embedding of Steiner triple systems into (K4−e)-designs II
43. Minimum embedding of Steiner triple systems into (K4-e)-designs I
44. Edge-packing of graphs and network reliability
45. Completing small partial triple systems
46. Percentages in pairwise balanced designs
47. A census of regular 3-polystroma arising from honeycombs
48. PII: S0012-365X(02)00472-7
49. PII: S0012-365X(00)00407-6
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.