C. A. Rodger
List of publications from the DBLP Bibliography Server - FAQ
2009 | ||
---|---|---|
57 | EE | Charles Curtis Lindner, Gaetano Quattrocchi, Christopher A. Rodger: Embedding Steiner triple systems in hexagon triple systems. Discrete Mathematics 309(2): 487-490 (2009) |
2008 | ||
56 | EE | Hung-Lin Fu, S. L. Logan, Christopher A. Rodger: Maximal sets of hamilton cycles in K2p-F. Discrete Mathematics 308(13): 2822-2829 (2008) |
55 | EE | Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger: Resolvable gregarious cycle decompositions of complete equipartite graphs. Discrete Mathematics 308(13): 2844-2853 (2008) |
54 | EE | Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith: All graphs with maximum degree three whose complements have 4-cycle decompositions. Discrete Mathematics 308(13): 2901-2909 (2008) |
53 | EE | Elizabeth J. Billington, Christopher A. Rodger: Resolvable 4-cycle group divisible designs with two associate classes: Part size even. Discrete Mathematics 308(2-3): 303-307 (2008) |
2007 | ||
52 | EE | C. A. Rodger, S. K. Westbrook: Decompositions of lambda K v . J. Comb. Optim. 14(2-3): 259-265 (2007) |
2005 | ||
51 | David James Ashe, Christopher A. Rodger, Hung-Lin Fu: All 2-Regular Leaves of Partial 6-cycle Systems. Ars Comb. 76: (2005) | |
50 | EE | Peter D. Johnson Jr., Christopher A. Rodger: Coloring the vertices of a graph with measurable sets in a probability space. Eur. J. Comb. 26(2): 251-257 (2005) |
49 | EE | Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger: Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs and Combinatorics 21(2): 169-186 (2005) |
2004 | ||
48 | EE | C. David Leach, Christopher A. Rodger: Hamilton decompositions of complete graphs with a 3-factor leave. Discrete Mathematics 279(1-3): 337-344 (2004) |
47 | EE | David James Ashe, Hung-Lin Fu, Christopher A. Rodger: A solution to the forest leave problem for partial 6-cycle systems. Discrete Mathematics 281(1-3): 27-41 (2004) |
46 | EE | Christopher A. Rodger, Dean G. Hoffman: Preface. Discrete Mathematics 284(1-3): 1-7 (2004) |
45 | EE | Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger: Decomposing KncupP into triangles. Discrete Mathematics 284(1-3): 131-136 (2004) |
44 | EE | J. W. McGee, Christopher A. Rodger: Embedding coverings of 2-paths with 3-paths. Discrete Mathematics 284(1-3): 217-223 (2004) |
43 | EE | C. A. Rodger: Hamilton Decomposable Graphs with Specified Leaves. Graphs and Combinatorics 20(4): 541-543 (2004) |
2003 | ||
42 | EE | Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger: A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k), kgeq3, where c(k) is a quadratic function of k. Discrete Mathematics 261(1-3): 325-336 (2003) |
41 | EE | Charles Curtis Lindner, Christopher A. Rodger: A connection between varieties of quasigroups and graph decompositions. Discrete Mathematics 272(2-3): 127-137 (2003) |
40 | EE | Anthony J. W. Hilton, Michael E. Mays, Christopher A. Rodger, C. St. J. A. Nash-Williams: Hamiltonian double latin squares. J. Comb. Theory, Ser. B 87(1): 81-129 (2003) |
39 | EE | Anthony J. W. Hilton, Matthew Johnson, Christopher A. Rodger, Evan B. Wantland: Amalgamations of connected k-factorizations. J. Comb. Theory, Ser. B 88(2): 267-279 (2003) |
2002 | ||
38 | EE | Peter D. Johnson Jr., Christopher A. Rodger: Coloring the Vertices of a Graph With Measurable Sets in a Probability Space. Electronic Notes in Discrete Mathematics 11: 417-424 (2002) |
37 | EE | C. David Leach, Christopher A. Rodger: Fair Hamilton Decompositions of Complete Multipartite Graphs. J. Comb. Theory, Ser. B 85(2): 290-296 (2002) |
2001 | ||
36 | H. L. Fu, Christopher A. Rodger: Four-Cycle Systems with Two-Regular Leaves. Graphs and Combinatorics 17(3): 457-461 (2001) | |
2000 | ||
35 | EE | C. Grant, Christopher A. Rodger: An n to 2n embedding of incomplete idempotent latin squares for small values ofn. Discrete Mathematics 211: 53-74 (2000) |
1999 | ||
34 | Hung-Lin Fu, Christopher A. Rodger: Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). Ars Comb. 53: (1999) | |
33 | Michael Edwin Raines, Christopher A. Rodger: Embedding Partial Extended Triple Systems when l >= 2. Ars Comb. 53: (1999) | |
32 | Hung-Lin Fu, Christopher A. Rodger, Dinesh G. Sarvate: The existence of group divisible designs with first and second associates, having block size 3. Ars Comb. 54: (1999) | |
31 | EE | Mike Daven, C. A. Rodger: (k, g)-cages are 3-connected. Discrete Mathematics 199(1-3): 207-215 (1999) |
1998 | ||
30 | EE | H. L. Fu, Charles C. Lindner, C. A. Rodger: Two Doyen-Wilson theorems for maximum packings with triples. Discrete Mathematics 178(1-3): 63-71 (1998) |
29 | EE | Hung-Lin Fu, Christopher A. Rodger: Group Divisible Designs with Two Associate Classes: n=2 orm=2. J. Comb. Theory, Ser. A 83(1): 94-117 (1998) |
1997 | ||
28 | EE | Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer: Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. Discrete Mathematics 171(1-3): 55-75 (1997) |
27 | EE | Charles C. Lindner, Christopher A. Rodger: On equationally defining extended cycle systems, . Discrete Mathematics 173(1-3): 1-14 (1997) |
26 | EE | Michael Edwin Raines, Christopher A. Rodger: Embedding partial extended triple systems and totally symmetric quasigroups. Discrete Mathematics 176(1-3): 211-222 (1997) |
1996 | ||
25 | Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger: 5-Cycle Systems with Holes. Des. Codes Cryptography 8(1-2): 103-108 (1996) | |
24 | EE | Dean G. Hoffman, C. A. Rodger: On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs. Discrete Mathematics 160(1-3): 177-187 (1996) |
1994 | ||
23 | EE | C. A. Rodger: Linear spaces with many small lines. Discrete Mathematics 129(1-3): 167-180 (1994) |
22 | Darryn E. Bryant, Christopher A. Rodger: The Doyen-Wilson Theorem Extended to 5-Cycles. J. Comb. Theory, Ser. A 68(1): 218-225 (1994) | |
1993 | ||
21 | EE | Kevin T. Phelps, Christopher A. Rodger: Nesting partial Steiner triple systems with 2-regular leave graphs. Discrete Mathematics 112(1-3): 165-172 (1993) |
20 | EE | Charles C. Lindner, C. A. Rodger: A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m. Discrete Mathematics 117(1-3): 151-159 (1993) |
19 | M. Colby, C. A. Rodger: Cycle Decompositions of the Line Graph of Kn. J. Comb. Theory, Ser. A 62(1): 158-161 (1993) | |
18 | EE | Dean G. Hoffman, Christopher A. Rodger, Alexander Rosa: Maximal Sets of 2-Factors and Hamiltonian Cycles. J. Comb. Theory, Ser. B 57(1): 69-76 (1993) |
1992 | ||
17 | EE | Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, J. Yin, Lie Zhu: Existence of perfect Mendelsohn designs with k=5 and lambda>1. Discrete Mathematics 103(2): 129-137 (1992) |
16 | EE | Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, Lie Zhu: Constructions of perfect Mendelsohn designs. Discrete Mathematics 103(2): 139-151 (1992) |
15 | EE | Charles C. Lindner, C. A. Rodger: 2-perfect m-cycle systems. Discrete Mathematics 104(1): 83-90 (1992) |
1991 | ||
14 | EE | Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger: Directed star decompositions of directed multigraphs. Discrete Mathematics 97(1-3): 139-148 (1991) |
13 | EE | Anthony J. W. Hilton, Christopher A. Rodger: The embedding of partial triple systems when 4 divides lambda. J. Comb. Theory, Ser. A 56(1): 109-137 (1991) |
12 | EE | Charles Curtis Lindner, Kevin T. Phelps, Christopher A. Rodger: The spectrum for 2-perfect 6-cycle systems. J. Comb. Theory, Ser. A 57(1): 76-85 (1991) |
1990 | ||
11 | EE | Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson: Small embeddings for partial cycle systems of odd length. Discrete Mathematics 80(3): 273-280 (1990) |
1989 | ||
10 | EE | Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson: Nesting of cycle systems of odd length. Discrete Mathematics 77(1-3): 191-203 (1989) |
9 | Douglas A. Leonard, C. A. Rodger: Limiting error propagation in Viterbi decoding of convolutional codes. IEEE Transactions on Information Theory 35(6): 1295- (1989) | |
1988 | ||
8 | EE | Katherine Heinrich, Charles Curtis Lindner, Christopher A. Rodger: Almost resolvable decompositions of 2Kn into cycles of odd length. J. Comb. Theory, Ser. A 49(2): 218-232 (1988) |
7 | EE | Dean G. Hoffman, Christopher A. Rodger: Class one graphs. J. Comb. Theory, Ser. B 44(3): 372-376 (1988) |
1987 | ||
6 | EE | C. A. Rodger: Embedding partial Mendelsohn triple systems. Discrete Mathematics 65(2): 187-196 (1987) |
5 | EE | Christopher A. Rodger, S. J. Stubbs: Embedding partial triple systems. J. Comb. Theory, Ser. A 44(2): 241-252 (1987) |
1986 | ||
4 | EE | Anthony J. W. Hilton, Christopher A. Rodger: Hamiltonian decompositions of complete regular s-partite graphs. Discrete Mathematics 58(1): 63-78 (1986) |
1984 | ||
3 | Douglas A. Leonard, C. A. Rodger: Explicit Kerdock codes over GF(2). AAECC 1984: 130-135 | |
2 | EE | C. A. Rodger: Embedding an incomplete latin square in a latin square with a prescribed diagonal. Discrete Mathematics 51(1): 73-89 (1984) |
1 | Charles J. Colbourn, Rose C. Hamm, C. A. Rodger: Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda. J. Comb. Theory, Ser. A 37(3): 363-369 (1984) |