Christopher A. Rodger

发表

Packing λ-Fold Complete Multipartite Graphs with 4-Cycles

Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger, 2005, Graphs Comb..

Limiting error propagation in Viterbi decoding of convolutional codes

Christopher A. Rodger, Douglas A. Leonard, 1989, IEEE Trans. Inf. Theory.

TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS

Christopher A. Rodger, Yanxun Chang, Darryn Bryant, 2002 .

Hamiltonian double latin squares

Anthony J. W. Hilton, Christopher A. Rodger, Michael E. Mays, 2003, J. Comb. Theory, Ser. B.

An n to 2n embedding of incomplete idempotent latin squares for small values ofn

Christopher A. Rodger, Carrie E. A. Grant, 2000, Discret. Math..

Cycle Decompositions of the Line Graph of Kn

Christopher A. Rodger, M. Colby, 1993, J. Comb. Theory, Ser. A.

Fair Hamilton Decompositions of Complete Multipartite Graphs

Christopher A. Rodger, C. David Leach, 2002, J. Comb. Theory, Ser. B.

The existence of group divisible designs with first and second associates, having block size 3

Dinesh G. Sarvate, Hung-Lin Fu, Christopher A. Rodger, 1999, Ars Comb..

Preface

Dean G. Hoffman, Christopher A. Rodger, 2004, Discret. Math..

Internally Fair Factorizations and Internally Fair Holey Factorizations with Prescribed Regularity

Christopher A. Rodger, Aras Erzurumluoglu, 2017, Electron. J. Comb..

Nesting directed cycle systems of even length

Douglas R. Stinson, Christopher A. Rodger, Douglas R Stinson, 1992, Eur. J. Comb..

Enclosings of λ-fold 5-cycle systems for u=2

Christopher A. Rodger, John Asplund, Melissa S. Keranen, 2015, Discret. Math..

Coding Theory: The Essentials

Kevin T. Phelps, Christopher A. Rodger, D. G. Hoffman, 1991 .

Maximal Sets of 2-Factors and Hamiltonian Cycles

Dean G. Hoffman, Christopher A. Rodger, Alexander Rosa, 1993, J. Comb. Theory, Ser. B.

Decomposing KncupP into triangles

Hung-Lin Fu, Christopher A. Rodger, Chin-Mei Fu, 2004, Discret. Math..

Gregarious GDDs with Two Associate Classes

Christopher A. Rodger, Narong Punnim, Saad El-Zanati, 2010, Graphs Comb..

search-an update. In Cracking DES : of "black-box" cryptography,

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Embedding coverings of 2-paths with 3-paths

Christopher A. Rodger, J. W. McGee, 2004, Discret. Math..

Resolvable gregarious cycle decompositions of complete equipartite graphs

Dean G. Hoffman, Elizabeth J. Billington, Christopher A. Rodger, 2008, Discret. Math..

C4-factorizations with two associate classes, λ1 is odd

Christopher A. Rodger, Michael A. Tiemeyer, 2011, Australas. J Comb..

Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice

Christopher A. Rodger, Atif A. Abueida, 2012, Discret. Math..

Embedding edge-colorings into 2-edge-connected k-factorizations of kkn+1

Christopher A. Rodger, Evan B. Wantland, 1995, J. Graph Theory.

More extreme equitable colorings of decompositions of Kv and Kv-F

Christopher A. Rodger, E. B. Matson, 2018, Discret. Math..

Group divisible designs with two associate classes, and quadratic leaves of triple systems

Christopher A. Rodger, Joe Chaffee, 2013, Discret. Math..

All 2-Regular Leaves of Partial 6-cycle Systems

Hung-Lin Fu, Christopher A. Rodger, David James Ashe, 2005, Ars Comb..

Constructions of perfect Mendelsohn designs

Kevin T. Phelps, Lie Zhu, Christopher A. Rodger, 1992, Discret. Math..

Embedding partial extended triple systems and totally symmetric quasigroups

Christopher A. Rodger, Michael Edwin Raines, C. Rodger, 1997, Discret. Math..

On the number of rainbow spanning trees in edge-colored complete graphs

Hung-Lin Fu, Christopher A. Rodger, Yuan-Hsun Lo, 2018, Discret. Math..

If the keyword was chosen from a dictionary, then it may be especially easy to

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Embedding an Edge-colored K(a(p); λ, μ) into a Hamiltonian Decomposition of K(a(p+r); λ, μ)

Christopher A. Rodger, M. Amin Bahmanian, 2013, Graphs Comb..

All graphs with maximum degree three whose complements have 4-cycle decompositions

Hung-Lin Fu, Christopher A. Rodger, Todd Smith, 2008, Discret. Math..

Directed star decompositions of the complete directed graph

Dean G. Hoffman, Charles J. Colbourn, Christopher A. Rodger, 1992, J. Graph Theory.

Coloring the Vertices of a Graph With Measurable Sets in a Probability Space

Christopher A. Rodger, Peter D. Johnson, 2002, Electron. Notes Discret. Math..

Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda

Charles J. Colbourn, Christopher A. Rodger, Rose C. Hamm, 1984, J. Comb. Theory, Ser. A.

Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs

Christopher A. Rodger, Aras Erzurumluoglu, 2016, Graphs Comb..

On the construction of odd cycle systems

Dean G. Hoffman, Christopher A. Rodger, Charles C. Lindner, 1989, J. Graph Theory.

Nesting and Almost Resolvability of Pentagon Systems

Christopher A. Rodger, Charles C. Lindner, C. Lindner, 1988, Eur. J. Comb..

Embedding Partial Extended Triple Systems when l >= 2

Christopher A. Rodger, Michael Edwin Raines, 1999, Ars Comb..

Introduction to Coding Theory : 1.1 Introduction of methods for efficient and accurate transfer of infor- of noise from compact disc recordings, the trans- of financial information across telephone lines, data transfer from one

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Hamilton decompositions of complete graphs with a 3-factor leave

Christopher A. Rodger, C. David Leach, 2004, Discret. Math..

of the one-time pad, DES was designed so that it would be "computationally : of cryptographic tools or prim- of strings of symbols from the alpha- if 5l = {0, then messages consist of strings of Os and

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Diagonally switchable 4-cycle systems revisited

Christopher A. Rodger, Chandra Dinavahi, C. Rodger, 2009, Australas. J Comb..

A connection between varieties of quasigroups and graph decompositions

Christopher A. Rodger, Charles C. Lindner, 2003, Discret. Math..

Hamilton decompositions of complete bipartite graphs with a 3-factor leave

Christopher A. Rodger, C. David Leach, Darryn E. Bryant, 2005, Australas. J Comb..

Embedding Partial 4-cycle Systems of Arbitrary Index

Christopher A. Rodger, April Parker, 2008, Graphs Comb..

Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14

Christopher A. Rodger, Darryn E. Bryant, Erin R. Spicer, 1997, Discret. Math..

Maximal sets of Hamilton cycles in Knr;λ1, λ2

Christopher A. Rodger, Mustafa Demir, C. Rodger, 2020, Discret. Math..

On equationally defining extended cycle systems,

Christopher A. Rodger, Charles C. Lindner, 1997, Discret. Math..

Existence of perfect Mendelsohn designs with k=5 and lambda>1

Kevin T. Phelps, Lie Zhu, Christopher A. Rodger, 1992, Discret. Math..

Revisiting the intersection problem for minimum coverings of complete graphs with triples

Christopher A. Rodger, Mariusz Meszka, Charles C. Lindner, 2017, Australas. J Comb..

Connectivity of cages

Hung-Lin Fu, Christopher A. Rodger, Kuo-Ching Huang, 1997, J. Graph Theory.

Path Decompositions Which Contain No Proper Subsystems

Christopher A. Rodger, Chandra Dinavahi, 2012, Ars Comb..

of these ciphers; readers interested in the details of DES should

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Class one graphs

Dean G. Hoffman, Christopher A. Rodger, C. Rodger, 1987, J. Comb. Theory, Ser. B.

A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9

Christopher A. Rodger, Charles C. Lindner, Selda Küçükçifçi, 2006, Ars Comb..

Path coverings with paths

Christopher A. Rodger, J. W. McGee, 2001, J. Graph Theory.

Total-colorings of complete multipartite graphs using amalgamations

Bhawani Sankar Panda, Christopher A. Rodger, Aseem Dalal, 2016, Discret. Math..

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, Christopher A. Rodger, Charles C. Lindner, 2003, Discret. Math..

Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs

Hongtao Zhao, Christopher A. Rodger, C. Rodger, 2015, Discret. Math..

Maximal sets of Hamilton cycles in Kn, n

Christopher A. Rodger, Darryn E. Bryant, Saad El-Zanati, 2000, J. Graph Theory.

Maximal sets of hamilton cycles in K2p-F

Christopher A. Rodger, Hung-Lin Fu, S. L. Logan, 2008, Discret. Math..

Group Divisible Designs with Two Associate Classes: n=2 orm=2

Hung-Lin Fu, Christopher A. Rodger, 1998, J. Comb. Theory, Ser. A.

A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)m

Christopher A. Rodger, Charles C. Lindner, 1993, Discret. Math..

Hamilton Decomposable Graphs with Specified Leaves

Christopher A. Rodger, C. Rodger, 2004, Graphs Comb..

C4-factorizations with two associate classes

Christopher A. Rodger, Michael A. Tiemeyer, 2008, Australas. J Comb..

Factorizations of complete multigraphs

Christopher A. Rodger, Darryn E. Bryant, B. J. Battersby, 1997, Australas. J Comb..

Almost resolvable decompositions of 2Kn into cycles of odd length

Christopher A. Rodger, Katherine Heinrich, Charles C. Lindner, 1988, J. Comb. Theory, Ser. A.

Maximal sets of hamilton cycles in complete multipartite graphs

Christopher A. Rodger, Jim A. MacDougall, Mike Daven, 2003, Australas. J Comb..

Hamilton decompositions of balanced complete multipartite graphs with primitive leaves

Christopher A. Rodger, Sibel Ozkan, 2010, Discret. Math..

Small embeddings for partial cycle systems of odd length

Douglas R. Stinson, Christopher A. Rodger, Charles C. Lindner, 1990, Discret. Math..

The Doyen-Wilson Theorem Extended to 5-Cycles

Christopher A. Rodger, Darryn E. Bryant, 1994, J. Comb. Theory, Ser. A.

Almost Resolvable Directed m-cycle systems: m = 3 (mod 6)

Hung-Lin Fu, Christopher A. Rodger, 1999, Ars Comb..

Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs

Christopher A. Rodger, L. McCauley, C. Rodger, 2008, Graphs Comb..

The chromatic index of complete multipartite graphs

Dean G. Hoffman, Christopher A. Rodger, C. Rodger, 1992, J. Graph Theory.

Amalgamations and Equitable Block-Colorings

Christopher A. Rodger, E. B. Matson, 2018, ICMC.

(k, G)-cages Are 3-connected

Christopher A. Rodger, Mike Daven, 1999, Discret. Math..

Hamilton decompositions of complete multipartite graphs with any 2-factor leave

Christopher A. Rodger, C. David Leach, 2003, J. Graph Theory.

Let C be an RS(Y, 8) which is used to transmit messages and let : of erasure locations and let A be the set of error locations; of error locations which are not erasure locations. Define f1 +x)

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

of the encoder and the decoder. Our desire

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

Nesting partial Steiner triple systems with 2-regular leave graphs

Kevin T. Phelps, Christopher A. Rodger, 1993, Discret. Math..

2 Introduction to cyclic codes : of a class of codes, called cyclic codes. Eventually we of cyclic codes to construct a generating matrix

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency

Christopher A. Rodger, Aseem Dalal, C. Rodger, 2015, Graphs Comb..

Enclosings of λ-fold 4-cycle systems

Christopher A. Rodger, N. A. Newman, 2010, Des. Codes Cryptogr..

The spectrum for 2-perfect 6-cycle systems

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 1991, J. Comb. Theory, Ser. A.

The intersection problem for minimum coverings of Kn by triples

Christopher A. Rodger, Charles C. Lindner, Eric Mendelsohn, 1991, Australas. J Comb..

Four-Cycle Systems with Two-Regular Leaves

Hung-Lin Fu, Christopher A. Rodger, 2001, Graphs Comb..

Multiply balanced edge colorings of multigraphs

Christopher A. Rodger, M. Amin Bahmanian, 2012, J. Graph Theory.

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs

Dean G. Hoffman, Christopher A. Rodger, 1996, Discret. Math..

A solution to the forest leave problem for partial 6-cycle systems

Hung-Lin Fu, Christopher A. Rodger, David James Ashe, 2004, Discret. Math..

2-colouring K4-e designs

Christopher A. Rodger, Mario Gionfriddo, Charles C. Lindner, 1991, Australas. J Comb..

Hamiltonian decompositions of complete regular s-partite graphs

Anthony J. W. Hilton, Christopher A. Rodger, 1986, Discret. Math..

Blocking set preserving embeddings of partial K4, -, e designs

Christopher A. Rodger, Charles C. Lindner, 1995, Australas. J Comb..

Two Doyen-Wilson theorems for maximum packings with triples

Hung-Lin Fu, Christopher A. Rodger, Charles C. Lindner, 1998, Discret. Math..

Cycle systems of the line graph of the complete graph

Christopher A. Rodger, B. A. Cox, 1996, J. Graph Theory.

Resolvable 4-cycle group divisible designs with two associate classes: Part size even

Elizabeth J. Billington, Christopher A. Rodger, 2008, Discret. Math..

Embedding Steiner triple systems in hexagon triple systems

Christopher A. Rodger, Charles C. Lindner, Gaetano Quattrocchi, 2009, Discret. Math..

Embedding an incomplete latin square in a latin square with a prescribed diagonal

Christopher A. Rodger, C. Rodger, 1984, Discret. Math..

Coloring the vertices of a graph with measurable sets in a probability space

Christopher A. Rodger, Peter D. Johnson, 2005, Eur. J. Comb..

Directed star decompositions of directed multigraphs

Dean G. Hoffman, Charles J. Colbourn, Christopher A. Rodger, 1991, Discret. Math..

Embedding partial triple systems

Christopher A. Rodger, S. J. Stubbs, C. Rodger, 1987, J. Comb. Theory, Ser. A.

On the embedding of partial three path designs

Christopher A. Rodger, T. R. Whitt, 2016, Discret. Math..

Decomposition of the Kneser Graph into paths of length four

Christopher A. Rodger, T. R. Whitt, 2015, Discret. Math..

Forest leaves and four-cycles

Hung-Lin Fu, Christopher A. Rodger, 2000, J. Graph Theory.

Embedding partial Mendelsohn triple systems

Christopher A. Rodger, 1987, Discret. Math..

Embedding Factorizations for 3-Uniform Hypergraphs

Christopher A. Rodger, M. Amin Bahmanian, 2013, J. Graph Theory.

Explicit Kerdock codes over GF(2)

Christopher A. Rodger, Douglas A. Leonard, 1984, AAECC.

2-Regular leaves of partial 8-cycle systems

Christopher A. Rodger, C. David Leach, David James Ashe, 2007, Australas. J Comb..

= = = : of Algorithm 6.3.2, the original syndromes and (6.7):

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2000 .

The embedding of partial triple systems when 4 divides lambda

Anthony J. W. Hilton, Christopher A. Rodger, 1991, J. Comb. Theory, Ser. A.

2-perfect M-cycle Systems

Christopher A. Rodger, Charles C. Lindner, C. Lindner, 1992, Discret. Math..

Nesting of cycle systems of odd length

Douglas R. Stinson, Christopher A. Rodger, Charles C. Lindner, 1989, Discret. Math..

The directed almost resolvable Hamilton-Waterloo problem

Christopher A. Rodger, Italo J. Dejter, David A. Pike, 1998, Australas. J Comb..

Fair and internally fair (holey) hamiltonian decompositions of

Christopher A. Rodger, Aras Erzurumluoglu, 2018, Discret. Math..

5-Cycle Systems with Holes

Dean G. Hoffman, Christopher A. Rodger, Darryn E. Bryant, 1996, Des. Codes Cryptogr..

Amalgamations of connected k-factorizations

Anthony J. W. Hilton, Christopher A. Rodger, Evan B. Wantland, 2003, J. Comb. Theory, Ser. B.

Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames

Christopher A. Rodger, Aras Erzurumluoglu, 2015, Discret. Math..

Equitable block-colorings of C4-decompositions of Kv-F

Christopher A. Rodger, Shanhai Li, 2016, Discret. Math..

Hamilton decompositions of graphs with primitive complements

Christopher A. Rodger, Sibel Ozkan, C. Rodger, 2009, Discret. Math..

Linear spaces with many small lines

Christopher A. Rodger, C. Rodger, 1994, Discret. Math..

Some results on Bhaskar Rao designs

Christopher A. Rodger, Deborah J. Street, 1980 .

Connectivity of cages

Hung-Lin Fu, Christopher A. Rodger, Kuo-Ching Huang, 1997 .

Hamilton decompositions of complete multipartite graphs with any 2-factor leave

Christopher A. Rodger, C. D. Leach, 2003 .

Packing complete multipartite graphs with 4-cycles

Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger, 2001 .

On equationally defining m‐perfect 2m + 1 cycle systems

Christopher A. Rodger, C. C. Lindner, 1994 .

Nondisconnecting disentanglements of amalgamated 2‐factorizations of complete multipartite graphs

Christopher A. Rodger, C. David Leach, C. Rodger, 2001 .

The Doyen-Wilson theorem for minimum coverings with triples

Hung-Lin Fu, Christopher A. Rodger, C. C. Lindner, 1997 .

Coding Theory and Cryptography : The Essentials

Kevin T. Phelps, Christopher A. Rodger, Charles C. Lindner, 2022 .

Embedding directed and undirected partial cycle systems of index λ > 1

Christopher A. Rodger, C. C. Lindner, 1993 .

TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS

Christopher A. Rodger, Yanxun Chang, Darryn Bryant, 2002 .

On inequivalent weighing matrices

Jennifer Seberry, Christopher A. Rodger, J. Seberry, 1986 .

Existence of certain skew room frames with application to weakly 3-chromatic linear spaces

Christopher A. Rodger, K. Chen, L. Zhu, 1994 .

All (k;g)-cages are k-edge-connected

Mirka Miller, Christopher A. Rodger, Yuqing Lin, 2005 .

On the doyen‐wilson theorem for m‐cycle systems

Christopher A. Rodger, Darryn Bryant, 1994 .

2-colouring K 4 -e designs.

Christopher A. Rodger, Mario Gionfriddo, Charles C. Lindner, 1991 .