Christopher A. Rodger

Publication Activity (10 Years)

Years Active: 1986-2022
Publications (10 Years): 7

Top Topics

Top Venues

Electron. J. Comb.

Publications

Lars Døvling Andersen, Stacie Baumann, Anthony J. W. Hilton, Christopher A. Rodger
On Completing Partial Latin Squares with Prescribed Diagonals. Electron. J. Comb. 29 (3) (2022)
Mustafa Demir, Christopher A. Rodger
Maximal sets of Hamilton cycles in Knr;λ1, λ2. Discret. Math. 343 (10) (2020)
E. B. Matson, Christopher A. Rodger
Amalgamations and Equitable Block-Colorings. ICMC (2018)
Aras Erzurumluoglu, Christopher A. Rodger
Internally Fair Factorizations and Internally Fair Holey Factorizations with Prescribed Regularity. Electron. J. Comb. 24 (3) (2017)
Charles C. Lindner, Christopher A. Rodger, Mariusz Meszka
Revisiting the intersection problem for minimum coverings of complete graphs with triples. Australas. J Comb. 68 (2017)
T. R. Whitt III, Christopher A. Rodger
On the embedding of partial three path designs. Discret. Math. 339 (5) (2016)
Aras Erzurumluoglu, Christopher A. Rodger
Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs. Graphs Comb. 32 (4) (2016)
M. Amin Bahmanian, Christopher A. Rodger
Embedding Factorizations for 3-Uniform Hypergraphs. J. Graph Theory 73 (2) (2013)
Christopher A. Rodger, Michael A. Tiemeyer
is odd. Australas. J Comb. 50 (2011)
Saad I. El-Zanati, Narong Punnim, Christopher A. Rodger
Gregarious GDDs with Two Associate Classes. Graphs Comb. 26 (6) (2010)
Chandra Dinavahi, Christopher A. Rodger
Diagonally switchable 4-cycle systems revisited. Australas. J Comb. 43 (2009)
Charles Curtis Lindner, Gaetano Quattrocchi, Christopher A. Rodger
Embedding Steiner triple systems in hexagon triple systems. Discret. Math. 309 (2) (2009)
Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger
Resolvable gregarious cycle decompositions of complete equipartite graphs. Discret. Math. 308 (13) (2008)
Christopher A. Rodger, Michael A. Tiemeyer
-factorizations with two associate classes. Australas. J Comb. 40 (2008)
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith
All graphs with maximum degree three whose complements have 4-cycle decompositions. Discret. Math. 308 (13) (2008)
Hung-Lin Fu, S. L. Logan, Christopher A. Rodger
-F. Discret. Math. 308 (13) (2008)
Elizabeth J. Billington, Christopher A. Rodger
Resolvable 4-cycle group divisible designs with two associate classes: Part size even. Discret. Math. 308 (2-3) (2008)
David James Ashe, C. David Leach, Christopher A. Rodger
2-Regular leaves of partial 8-cycle systems. Australas. J Comb. 39 (2007)
Sasha Logan Jarrell, Christopher A. Rodger
Maximal sets of Hamilton cycles in complete multipartite graphs II. Australas. J Comb. 39 (2007)
Selda Küçükçifçi, Curt Lindner, Christopher A. Rodger
A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9. Ars Comb. 79 (2006)
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) (2005)
Darryn E. Bryant, C. David Leach, Christopher A. Rodger
Hamilton decompositions of complete bipartite graphs with a 3-factor leave. Australas. J Comb. 31 (2005)
David James Ashe, Christopher A. Rodger, Hung-Lin Fu
All 2-Regular Leaves of Partial 6-cycle Systems. Ars Comb. 76 (2005)
Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger
Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs Comb. 21 (2) (2005)
C. David Leach, Christopher A. Rodger
Hamilton decompositions of complete graphs with a 3-factor leave. Discret. Math. 279 (1-3) (2004)
Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger
into triangles. Discret. Math. 284 (1-3) (2004)
David James Ashe, Hung-Lin Fu, Christopher A. Rodger
A solution to the forest leave problem for partial 6-cycle systems. Discret. Math. 281 (1-3) (2004)
J. W. McGee, Christopher A. Rodger
Embedding coverings of 2-paths with 3-paths. Discret. Math. 284 (1-3) (2004)
Christopher A. Rodger, Dean G. Hoffman
Preface. Discret. Math. 284 (1-3) (2004)
Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger
. Discret. Math. 261 (1-3) (2003)
Charles Curtis Lindner, Christopher A. Rodger
A connection between varieties of quasigroups and graph decompositions. Discret. Math. 272 (2-3) (2003)
Anthony J. W. Hilton, Matthew Johnson, Christopher A. Rodger, Evan B. Wantland
Amalgamations of connected k-factorizations. J. Comb. Theory, Ser. B 88 (2) (2003)
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) (2003)
C. David Leach, Christopher A. Rodger
Fair Hamilton Decompositions of Complete Multipartite Graphs. J. Comb. Theory, Ser. B 85 (2) (2002)
Peter D. Johnson Jr., Christopher A. Rodger
Coloring the Vertices of a Graph With Measurable Sets in a Probability Space. Electron. Notes Discret. Math. 11 (2002)
H. L. Fu, Christopher A. Rodger
Four-Cycle Systems with Two-Regular Leaves. Graphs Comb. 17 (3) (2001)
J. W. McGee, Christopher A. Rodger
Path coverings with paths. J. Graph Theory 36 (3) (2001)
Darryn E. Bryant, Saad I. El-Zanati, Christopher A. Rodger
. J. Graph Theory 33 (1) (2000)
Carrie E. A. Grant, Christopher A. Rodger
. Discret. Math. 211 (2000)
Hung-Lin Fu, Christopher A. Rodger
Forest leaves and four-cycles. J. Graph Theory 33 (3) (2000)
Michael Edwin Raines, Christopher A. Rodger
Embedding Partial Extended Triple Systems when l >= 2. Ars Comb. 53 (1999)
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)
Hung-Lin Fu, Christopher A. Rodger
Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). Ars Comb. 53 (1999)
Hung-Lin Fu, Christopher A. Rodger
Group Divisible Designs with Two Associate Classes: n=2 orm=2. J. Comb. Theory, Ser. A 83 (1) (1998)
Italo J. Dejter, David A. Pike, Christopher A. Rodger
The directed almost resolvable Hamilton-Waterloo problem. Australas. J Comb. 18 (1998)
Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger
Connectivity of cages. J. Graph Theory 24 (2) (1997)
Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer
Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. Discret. Math. 171 (1-3) (1997)
B. J. Battersby, Darryn E. Bryant, Christopher A. Rodger
Factorizations of complete multigraphs. Australas. J Comb. 16 (1997)
Michael Edwin Raines, Christopher A. Rodger
Embedding partial extended triple systems and totally symmetric quasigroups. Discret. Math. 176 (1-3) (1997)
Charles C. Lindner, Christopher A. Rodger
. Discret. Math. 173 (1-3) (1997)
Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger
5-Cycle Systems with Holes. Des. Codes Cryptogr. 8 (1-2) (1996)
Darryn E. Bryant, Christopher A. Rodger
The Doyen-Wilson Theorem Extended to 5-Cycles. J. Comb. Theory, Ser. A 68 (1) (1994)
Kevin T. Phelps, Christopher A. Rodger
Nesting partial Steiner triple systems with 2-regular leave graphs. Discret. Math. 112 (1-3) (1993)
Dean G. Hoffman, Christopher A. Rodger, Alexander Rosa
Maximal Sets of 2-Factors and Hamiltonian Cycles. J. Comb. Theory, Ser. B 57 (1) (1993)
Christopher A. Rodger, Douglas R. Stinson
Nesting directed cycle systems of even length. Eur. J. Comb. 13 (3) (1992)
Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, Lie Zhu
Constructions of perfect Mendelsohn designs. Discret. Math. 103 (2) (1992)
Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, J. Yin, Lie Zhu
Existence of perfect Mendelsohn designs with k=5 and lambda>1. Discret. Math. 103 (2) (1992)
Dean G. Hoffman, Christopher A. Rodger
The chromatic index of complete multipartite graphs. J. Graph Theory 16 (2) (1992)
Anthony J. W. Hilton, Christopher A. Rodger
The embedding of partial triple systems when 4 divides lambda. J. Comb. Theory, Ser. A 56 (1) (1991)
Charles Curtis Lindner, Kevin T. Phelps, Christopher A. Rodger
The spectrum for 2-perfect 6-cycle systems. J. Comb. Theory, Ser. A 57 (1) (1991)
Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson
Small embeddings for partial cycle systems of odd length. Discret. Math. 80 (3) (1990)
Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson
Nesting of cycle systems of odd length. Discret. Math. 77 (1-3) (1989)
Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger
On the construction of odd cycle systems. J. Graph Theory 13 (4) (1989)
Charles C. Lindner, Christopher A. Rodger
Nesting and Almost Resolvability of Pentagon Systems. Eur. J. Comb. 9 (5) (1988)
Dean G. Hoffman, Christopher A. Rodger
Class one graphs. J. Comb. Theory, Ser. B 44 (3) (1988)
Katherine Heinrich, Charles Curtis Lindner, Christopher A. Rodger
into cycles of odd length. J. Comb. Theory, Ser. A 49 (2) (1988)
Christopher A. Rodger, S. J. Stubbs
Embedding partial triple systems. J. Comb. Theory, Ser. A 44 (2) (1987)
Anthony J. W. Hilton, Christopher A. Rodger
Hamiltonian decompositions of complete regular s-partite graphs. Discret. Math. 58 (1) (1986)