The following pages link to Peter Danziger (Q281574):
Displaying 46 items.
- Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
- A cyclic solution for an infinite class of Hamilton-Waterloo problems (Q292248) (← links)
- On generalized Howell designs with block size three (Q306349) (← links)
- On the existence of unparalleled even cycle systems (Q326644) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- On the intersection problem for Steiner triple systems of different orders (Q855301) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- Maximum uniformly resolvable designs with block sizes 2 and 4 (Q1044939) (← links)
- Minimum embedding of a \(P_{4}\)-design into a balanced incomplete block design of index \(\lambda \) (Q1044960) (← links)
- (Q1744748) (redirect page) (← links)
- On the Hamilton-Waterloo problem with cycle lengths of distinct parities (Q1744749) (← links)
- Bicolour graphs of Steiner triple systems (Q1861287) (← links)
- On the chromatic index of path decompositions (Q1876679) (← links)
- Class-uniformly resolvable group divisible structures. I: Resolvable group divisible designs (Q1883633) (← links)
- Class-uniformly resolvable group divisible structures. II: Frames (Q1883634) (← links)
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings (Q2120828) (← links)
- Cops that surround a robber (Q2197471) (← links)
- Cycle decompositions of complete digraphs (Q2227833) (← links)
- The Hamilton-Waterloo problem with even cycle lengths (Q2319702) (← links)
- Monogamous latin squares (Q2431245) (← links)
- Resolvability of infinite designs (Q2434885) (← links)
- (Q2713358) (← links)
- Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit (Q2842263) (← links)
- Orthogonally Resolvable Cycle Decompositions (Q2950653) (← links)
- (Q3011784) (← links)
- Geometrical constructions of class-uniformly resolvable structure (Q3100728) (← links)
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem (Q3174234) (← links)
- Resolvable modified group divisible designs with block size three (Q3418722) (← links)
- (Q3517156) (← links)
- The Hamilton-Waterloo problem for cycle sizes 3 and 4 (Q3578158) (← links)
- (Q3595366) (← links)
- (Q3842522) (← links)
- (Q4357344) (← links)
- On the Hamilton–Waterloo problem with odd cycle lengths (Q4642157) (← links)
- (Q4876987) (← links)
- (Q4887948) (← links)
- (Q4892324) (← links)
- On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors (Q4909344) (← links)
- (Q4940049) (← links)
- Bipartite 2‐Factorizations of Complete Multipartite Graphs (Q4982289) (← links)
- Tic-Tac-Toe on an Affine Plane of order 4 (Q5080903) (← links)
- On the generalized Oberwolfach problem (Q5217059) (← links)
- On the Hamilton–Waterloo Problem with Odd Orders (Q5349281) (← links)
- Hill‐climbing to Pasch valleys (Q5434625) (← links)
- Covering Arrays Avoiding Forbidden Edges (Q5505668) (← links)
- Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem (Q6071955) (← links)
