dblp.uni-trier.dewww.uni-trier.de

Christopher A. Rodger

C. A. Rodger

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
57EECharles Curtis Lindner, Gaetano Quattrocchi, Christopher A. Rodger: Embedding Steiner triple systems in hexagon triple systems. Discrete Mathematics 309(2): 487-490 (2009)
2008
56EEHung-Lin Fu, S. L. Logan, Christopher A. Rodger: Maximal sets of hamilton cycles in K2p-F. Discrete Mathematics 308(13): 2822-2829 (2008)
55EEElizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger: Resolvable gregarious cycle decompositions of complete equipartite graphs. Discrete Mathematics 308(13): 2844-2853 (2008)
54EEChin-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)
53EEElizabeth 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
52EEC. 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)
50EEPeter 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)
49EEElizabeth 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
48EEC. David Leach, Christopher A. Rodger: Hamilton decompositions of complete graphs with a 3-factor leave. Discrete Mathematics 279(1-3): 337-344 (2004)
47EEDavid 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)
46EEChristopher A. Rodger, Dean G. Hoffman: Preface. Discrete Mathematics 284(1-3): 1-7 (2004)
45EEChin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger: Decomposing KncupP into triangles. Discrete Mathematics 284(1-3): 131-136 (2004)
44EEJ. W. McGee, Christopher A. Rodger: Embedding coverings of 2-paths with 3-paths. Discrete Mathematics 284(1-3): 217-223 (2004)
43EEC. A. Rodger: Hamilton Decomposable Graphs with Specified Leaves. Graphs and Combinatorics 20(4): 541-543 (2004)
2003
42EEDean 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)
41EECharles Curtis Lindner, Christopher A. Rodger: A connection between varieties of quasigroups and graph decompositions. Discrete Mathematics 272(2-3): 127-137 (2003)
40EEAnthony 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)
39EEAnthony 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
38EEPeter 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)
37EEC. 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
35EEC. 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)
31EEMike Daven, C. A. Rodger: (k, g)-cages are 3-connected. Discrete Mathematics 199(1-3): 207-215 (1999)
1998
30EEH. 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)
29EEHung-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
28EEDarryn 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)
27EECharles C. Lindner, Christopher A. Rodger: On equationally defining extended cycle systems, . Discrete Mathematics 173(1-3): 1-14 (1997)
26EEMichael 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)
24EEDean 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
23EEC. 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
21EEKevin T. Phelps, Christopher A. Rodger: Nesting partial Steiner triple systems with 2-regular leave graphs. Discrete Mathematics 112(1-3): 165-172 (1993)
20EECharles 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)
18EEDean 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
17EEFrank 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)
16EEFrank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, Lie Zhu: Constructions of perfect Mendelsohn designs. Discrete Mathematics 103(2): 139-151 (1992)
15EECharles C. Lindner, C. A. Rodger: 2-perfect m-cycle systems. Discrete Mathematics 104(1): 83-90 (1992)
1991
14EECharles J. Colbourn, Dean G. Hoffman, C. A. Rodger: Directed star decompositions of directed multigraphs. Discrete Mathematics 97(1-3): 139-148 (1991)
13EEAnthony 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)
12EECharles 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
11EECharles 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
10EECharles 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
8EEKatherine 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)
7EEDean G. Hoffman, Christopher A. Rodger: Class one graphs. J. Comb. Theory, Ser. B 44(3): 372-376 (1988)
1987
6EEC. A. Rodger: Embedding partial Mendelsohn triple systems. Discrete Mathematics 65(2): 187-196 (1987)
5EEChristopher A. Rodger, S. J. Stubbs: Embedding partial triple systems. J. Comb. Theory, Ser. A 44(2): 241-252 (1987)
1986
4EEAnthony 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
2EEC. 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)

Coauthor Index

1David James Ashe [47] [51]
2Frank E. Bennett [16] [17]
3Elizabeth J. Billington [49] [53] [55]
4Darryn E. Bryant [22] [25] [28]
5Charles J. Colbourn [1] [14]
6M. Colby [19]
7Mike Daven [31]
8Chin-Mei Fu [45] [54]
9Hung-Lin Fu (H. L. Fu) [29] [30] [32] [34] [36] [45] [47] [49] [51] [54] [56]
10C. Grant [35]
11Rose C. Hamm [1]
12Katherine Heinrich [8]
13Anthony J. W. Hilton [4] [13] [39] [40]
14Dean G. Hoffman [7] [14] [18] [24] [25] [42] [46] [55]
15Matthew Johnson [39]
16Peter D. Johnson Jr. [38] [50]
17C. David Leach [37] [48]
18Douglas A. Leonard [3] [9]
19Charles Curtis Lindner (Charles C. Lindner) [8] [10] [11] [12] [15] [20] [27] [30] [41] [42] [57]
20S. L. Logan [56]
21Michael E. Mays [40]
22J. W. McGee [44]
23C. St. J. A. Nash-Williams [40]
24Kevin T. Phelps [12] [16] [17] [21]
25Gaetano Quattrocchi [57]
26Michael Edwin Raines [26] [33]
27Alexander Rosa [18]
28Dinesh G. Sarvate [32]
29Todd Smith [54]
30Erin R. Spicer [28]
31Douglas R. Stinson [10] [11]
32S. J. Stubbs [5]
33Evan B. Wantland [39]
34S. K. Westbrook [52]
35J. Yin [17]
36Lie Zhu [16] [17]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)