Explicit Kerdock codes over GF(2). - Douglas A. Leonard; C. A. Rodger (AAECC, 1984)

Embedding an incomplete latin square in a latin square with a prescribed diagonal. - C. A. Rodger (Discret. Math., 1984)

Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda. - Charles J. Colbourn; Rose C. Hamm; C. A. Rodger (J. Comb. Theory A, 1984)

Hamiltonian decompositions of complete regular s-partite graphs. - Anthony J. W. Hilton; Christopher A. Rodger (Discret. Math., 1986)

Embedding partial Mendelsohn triple systems. - C. A. Rodger (Discret. Math., 1987)

Embedding partial triple systems. - Christopher A. Rodger; S. J. Stubbs (J. Comb. Theory A, 1987)

Nesting and Almost Resolvability of Pentagon Systems. - Charles C. Lindner; Christopher A. Rodger (Eur. J. Comb., 1988)

Almost resolvable decompositions of 2Kn into cycles of odd length. - Katherine Heinrich; Charles Curtis Lindner; Christopher A. Rodger (J. Comb. Theory A, 1988)

Class one graphs. - Dean G. Hoffman; Christopher A. Rodger (J. Comb. Theory B, 1988)

Nesting of cycle systems of odd length. - Charles C. Lindner; Christopher A. Rodger; Douglas R. Stinson (Discret. Math., 1989)

On the construction of odd cycle systems. - Dean G. Hoffman; Charles Curtis Lindner; Christopher A. Rodger (J. Graph Theory, 1989)

Limiting error propagation in Viterbi decoding of convolutional codes. - Douglas A. Leonard; C. A. Rodger (IEEE Trans. Inf. Theory, 1989)

Small embeddings for partial cycle systems of odd length. - Charles C. Lindner; Christopher A. Rodger; Douglas R. Stinson (Discret. Math., 1990)

2-colouring K4-e designs. - Mario Gionfriddo; Charles C. Lindner; C. A. Rodger (Australas. J Comb., 1991)

The intersection problem for minimum coverings of Kn by triples. - Charles C. Lindner; Eric Mendelsohn; C. A. Rodger (Australas. J Comb., 1991)

Directed star decompositions of directed multigraphs. - Charles J. Colbourn; Dean G. Hoffman; C. A. Rodger (Discret. Math., 1991)

The embedding of partial triple systems when 4 divides lambda. - Anthony J. W. Hilton; Christopher A. Rodger (J. Comb. Theory A, 1991)

The spectrum for 2-perfect 6-cycle systems. - Charles Curtis Lindner; Kevin T. Phelps; Christopher A. Rodger (J. Comb. Theory A, 1991)

Existence of perfect Mendelsohn designs with k=5 and lambda>1. - Frank E. Bennett; Kevin T. Phelps; Christopher A. Rodger; J. Yin; Lie Zhu (Discret. Math., 1992)

Constructions of perfect Mendelsohn designs. - Frank E. Bennett; Kevin T. Phelps; Christopher A. Rodger; Lie Zhu (Discret. Math., 1992)

2-perfect m-cycle systems. - Charles C. Lindner; C. A. Rodger (Discret. Math., 1992)

Nesting directed cycle systems of even length. - Christopher A. Rodger; Douglas R. Stinson (Eur. J. Comb., 1992)

Directed star decompositions of the complete directed graph. - Charles J. Colbourn; Dean G. Hoffman; C. A. Rodger (J. Graph Theory, 1992)

The chromatic index of complete multipartite graphs. - Dean G. Hoffman; Christopher A. Rodger (J. Graph Theory, 1992)

A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m. - Charles C. Lindner; C. A. Rodger (Discret. Math., 1993)

Nesting partial Steiner triple systems with 2-regular leave graphs. - Kevin T. Phelps; Christopher A. Rodger (Discret. Math., 1993)

Cycle Decompositions of the Line Graph of Kn. - M. Colby; C. A. Rodger (J. Comb. Theory A, 1993)

Maximal Sets of 2-Factors and Hamiltonian Cycles. - Dean G. Hoffman; Christopher A. Rodger; Alexander Rosa (J. Comb. Theory B, 1993)

Linear spaces with many small lines. - C. A. Rodger (Discret. Math., 1994)

The Doyen-Wilson Theorem Extended to 5-Cycles. - Darryn E. Bryant; Christopher A. Rodger (J. Comb. Theory A, 1994)

Blocking set preserving embeddings of partial K4, -, e designs. - Charles C. Lindner; C. A. Rodger (Australas. J Comb., 1995)

Embedding edge-colorings into 2-edge-connected k-factorizations of kkn+1. - C. A. Rodger; Evan B. Wantland (J. Graph Theory, 1995)

5-Cycle Systems with Holes. - Darryn E. Bryant; Dean G. Hoffman; Christopher A. Rodger (Des. Codes Cryptogr., 1996)

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs. - Dean G. Hoffman; C. A. Rodger (Discret. Math., 1996)

Cycle systems of the line graph of the complete graph. - B. A. Cox; C. A. Rodger (J. Graph Theory, 1996)

Factorizations of complete multigraphs. - B. J. Battersby; Darryn E. Bryant; Christopher A. Rodger (Australas. J Comb., 1997)

Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. - Darryn E. Bryant; Christopher A. Rodger; Erin R. Spicer (Discret. Math., 1997)

On equationally defining extended cycle systems, . - Charles C. Lindner; Christopher A. Rodger (Discret. Math., 1997)

Embedding partial extended triple systems and totally symmetric quasigroups. - Michael Edwin Raines; Christopher A. Rodger (Discret. Math., 1997)

Connectivity of cages. - Hung-Lin Fu; Kuo-Ching Huang; Christopher A. Rodger (J. Graph Theory, 1997)

The directed almost resolvable Hamilton-Waterloo problem. - Italo J. Dejter; David A. Pike; Christopher A. Rodger (Australas. J Comb., 1998)

Two Doyen-Wilson theorems for maximum packings with triples. - H. L. Fu; Charles C. Lindner; C. A. Rodger (Discret. Math., 1998)

Group Divisible Designs with Two Associate Classes: n=2 orm=2. - Hung-Lin Fu; Christopher A. Rodger (J. Comb. Theory A, 1998)

Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). - Hung-Lin Fu; Christopher A. Rodger (Ars Comb., 1999)

The existence of group divisible designs with first and second associates, having block size 3. - Hung-Lin Fu; Christopher A. Rodger; Dinesh G. Sarvate (Ars Comb., 1999)

Embedding Partial Extended Triple Systems when l >= 2. - Michael Edwin Raines; Christopher A. Rodger (Ars Comb., 1999)

(k, g)-cages are 3-connected. - Mike Daven; C. A. Rodger (Discret. Math., 1999)

An n to 2n embedding of incomplete idempotent latin squares for small values ofn. - Carrie E. A. Grant; Christopher A. Rodger (Discret. Math., 2000)

Maximal sets of Hamilton cycles in Kn, n. - Darryn E. Bryant; Saad I. El-Zanati; Christopher A. Rodger (J. Graph Theory, 2000)

Forest leaves and four-cycles. - Hung-Lin Fu; Christopher A. Rodger (J. Graph Theory, 2000)

4-Cycle Group-Divisible Designs with Two Associate Classes. - H. L. Fu; C. A. Rodger (Comb. Probab. Comput., 2001)

Four-Cycle Systems with Two-Regular Leaves. - H. L. Fu; Christopher A. Rodger (Graphs Comb., 2001)

Path coverings with paths. - J. W. McGee; Christopher A. Rodger (J. Graph Theory, 2001)

Coloring the Vertices of a Graph With Measurable Sets in a Probability Space. - Peter D. Johnson Jr.; Christopher A. Rodger (Electron. Notes Discret. Math., 2002)

Fair Hamilton Decompositions of Complete Multipartite Graphs. - C. David Leach; Christopher A. Rodger (J. Comb. Theory B, 2002)

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. - Dean G. Hoffman; Charles Curtis Lindner; Christopher A. Rodger (Discret. Math., 2003)

A connection between varieties of quasigroups and graph decompositions. - Charles Curtis Lindner; Christopher A. Rodger (Discret. Math., 2003)

Amalgamations of connected k-factorizations. - Anthony J. W. Hilton; Matthew Johnson 002; Christopher A. Rodger; Evan B. Wantland (J. Comb. Theory B, 2003)

Hamiltonian double latin squares. - Anthony J. W. Hilton; Michael E. Mays; Christopher A. Rodger; Crispin St. John Alvah Nash-Williams (J. Comb. Theory B, 2003)

Maximal sets of hamilton cycles in complete multipartite graphs. - Mike Daven; Jim A. MacDougall; C. A. Rodger (J. Graph Theory, 2003)

Hamilton decompositions of complete multipartite graphs with any 2-factor leave. - C. David Leach; C. A. Rodger (J. Graph Theory, 2003)

A solution to the forest leave problem for partial 6-cycle systems. - David James Ashe; Hung-Lin Fu; Christopher A. Rodger (Discret. Math., 2004)

Decomposing KncupP into triangles. - Chin-Mei Fu; Hung-Lin Fu; Christopher A. Rodger (Discret. Math., 2004)

Hamilton decompositions of complete graphs with a 3-factor leave. - C. David Leach; Christopher A. Rodger (Discret. Math., 2004)

Embedding coverings of 2-paths with 3-paths. - J. W. McGee; Christopher A. Rodger (Discret. Math., 2004)

Preface. - Christopher A. Rodger; Dean G. Hoffman (Discret. Math., 2004)

Hamilton Decomposable Graphs with Specified Leaves. - C. A. Rodger (Graphs Comb., 2004)

Hamilton decompositions of complete bipartite graphs with a 3-factor leave. - Darryn E. Bryant; C. David Leach; Christopher A. Rodger (Australas. J Comb., 2005)

All 2-Regular Leaves of Partial 6-cycle Systems. - David James Ashe; Christopher A. Rodger; Hung-Lin Fu (Ars Comb., 2005)

Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. - Elizabeth J. Billington; Hung-Lin Fu; Christopher A. Rodger (Graphs Comb., 2005)

A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9. - Selda Küçükçifçi; Curt Lindner; Christopher A. Rodger (Ars Comb., 2006)

2-Regular leaves of partial 8-cycle systems. - David James Ashe; C. David Leach; Christopher A. Rodger (Australas. J Comb., 2007)

Maximal sets of Hamilton cycles in complete multipartite graphs II. - Sasha Logan Jarrell; Christopher A. Rodger (Australas. J Comb., 2007)

Decompositions of lambda K v . - C. A. Rodger; S. K. Westbrook (J. Comb. Optim., 2007)

C4-factorizations with two associate classes. - Christopher A. Rodger; Michael A. Tiemeyer (Australas. J Comb., 2008)

Resolvable gregarious cycle decompositions of complete equipartite graphs. - Elizabeth J. Billington; Dean G. Hoffman; Christopher A. Rodger (Discret. Math., 2008)

Resolvable 4-cycle group divisible designs with two associate classes: Part size even. - Elizabeth J. Billington; Christopher A. Rodger (Discret. Math., 2008)

All graphs with maximum degree three whose complements have 4-cycle decompositions. - Chin-Mei Fu; Hung-Lin Fu; Christopher A. Rodger; Todd Smith (Discret. Math., 2008)

Maximal sets of hamilton cycles in K2p-F. - Hung-Lin Fu; S. L. Logan; Christopher A. Rodger (Discret. Math., 2008)

Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs. - L. McCauley; C. A. Rodger (Graphs Comb., 2008)

Embedding Partial 4-cycle Systems of Arbitrary Index. - April Parker; C. A. Rodger (Graphs Comb., 2008)

Diagonally switchable 4-cycle systems revisited. - Chandra Dinavahi; Christopher A. Rodger (Australas. J Comb., 2009)

Embedding Steiner triple systems in hexagon triple systems. - Charles Curtis Lindner; Gaetano Quattrocchi; Christopher A. Rodger (Discret. Math., 2009)

Hamilton decompositions of graphs with primitive complements. - Sibel Özkan; C. A. Rodger (Discret. Math., 2009)

Enclosings of lambda-fold 4-cycle systems. - N. A. Newman; C. A. Rodger (Des. Codes Cryptogr., 2010)

Hamilton decompositions of balanced complete multipartite graphs with primitive leaves. - Sibel Özkan; C. A. Rodger (Discret. Math., 2010)

Gregarious GDDs with Two Associate Classes. - Saad I. El-Zanati; Narong Punnim; Christopher A. Rodger (Graphs Comb., 2010)

C4-factorizations with two associate classes, λ1 is odd. - Christopher A. Rodger; Michael A. Tiemeyer (Australas. J Comb., 2011)

Path Decompositions Which Contain No Proper Subsystems. - Chandra Dinavahi; C. A. Rodger (Ars Comb., 2012)

Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice. - Atif A. Abueida; C. A. Rodger (Discret. Math., 2012)

Multiply balanced edge colorings of multigraphs. - M. Amin Bahmanian; C. A. Rodger (J. Graph Theory, 2012)

Group divisible designs with two associate classes, and quadratic leaves of triple systems. - Joe Chaffee; C. A. Rodger (Discret. Math., 2013)

Embedding an Edge-colored K(a (p); λ, μ) into a Hamiltonian Decomposition of K(a (p+r); λ, μ). - M. Amin Bahmanian; C. A. Rodger (Graphs Comb., 2013)

Embedding Factorizations for 3-Uniform Hypergraphs. - M. Amin Bahmanian; Christopher A. Rodger (J. Graph Theory, 2013)

Enclosings of λ-fold 5-cycle systems for u=2. - John Asplund; C. A. Rodger; Melissa S. Keranen (Discret. Math., 2015)

Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames. - Aras Erzurumluoglu; C. A. Rodger (Discret. Math., 2015)

Decomposition of the Kneser Graph into paths of length four. - T. R. Whitt III; C. A. Rodger (Discret. Math., 2015)

Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs. - Hongtao Zhao; C. A. Rodger (Discret. Math., 2015)

The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency. - Aseem Dalal; C. A. Rodger (Graphs Comb., 2015)

4-Cycle Systems of Kn-E(F*). - Nidhi Sehgal; C. A. Rodger (Graphs Comb., 2015)

Equitable block-colorings of C4-decompositions of Kv-F. - Shanhai Li; C. A. Rodger (Discret. Math., 2016)

On the embedding of partial three path designs. - T. R. Whitt III; Christopher A. Rodger (Discret. Math., 2016)

Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs. - Aras Erzurumluoglu; Christopher A. Rodger (Graphs Comb., 2016)

Revisiting the intersection problem for minimum coverings of complete graphs with triples. - Charles C. Lindner; Christopher A. Rodger; Mariusz Meszka (Australas. J Comb., 2017)

Internally Fair Factorizations and Internally Fair Holey Factorizations with Prescribed Regularity. - Aras Erzurumluoglu; Christopher A. Rodger (Electron. J. Comb., 2017)

Amalgamations and Equitable Block-Colorings. - Elizabeth Bailey Matson; Christopher A. Rodger (ICMC, 2018)

Extreme equitable block colorings of C4-decompositions of Kv-F. - Shanhai Li; Elizabeth Bailey Matson; Christopher A. Rodger (Australas. J Comb., 2018)

Fair and internally fair (holey) hamiltonian decompositions of. - Aras Erzurumluoglu; C. A. Rodger (Discret. Math., 2018)

On the number of rainbow spanning trees in edge-colored complete graphs. - Hung-Lin Fu; Yuan-Hsun Lo; K. E. Perry; C. A. Rodger (Discret. Math., 2018)

More extreme equitable colorings of decompositions of Kv and Kv-F. - Elizabeth Bailey Matson; C. A. Rodger (Discret. Math., 2018)

Maximal sets of Hamilton cycles in Knr;λ1, λ2. - Mustafa Demir; Christopher A. Rodger (Discret. Math., 2020)

Embedding an edge-coloring of K(nr;λ1, λ2) into a Hamiltonian decomposition of K(nr+2;λ1, λ2). - Mustafa Demir; C. A. Rodger (J. Graph Theory, 2020)

On Completing Partial Latin Squares with Prescribed Diagonals. - Lars Døvling Andersen; Stacie Baumann; Anthony J. W. Hilton; Christopher A. Rodger (Electron. J. Comb., 2022)

Maximal sets of Hamilton cycles in complete multipartite graphs IV. - David M. Tidwell; C. A. Rodger (Discret. Math., 2022)

Total colorings of complete multipartite graphs using amalgamations. - Aseem Dalal; Bhawani Sankar Panda; C. A. Rodger (Discret. Appl. Math., 2024)