Christopher A. Rodger

According to our database1, Christopher A. Rodger authored at least 112 papers between 1984 and 2020.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



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

Maximal sets of Hamilton cycles in Knr;λ1, λ2.
Discret. Math., 2020

More extreme equitable colorings of decompositions of Kv and Kv-F.
Discret. Math., 2018

On the number of rainbow spanning trees in edge-colored complete graphs.
Discret. Math., 2018

Fair and internally fair (holey) hamiltonian decompositions of.
Discret. Math., 2018

Amalgamations and Equitable Block-Colorings.
Proceedings of the Mathematics and Computing - 4th International Conference, 2018

Internally Fair Factorizations and Internally Fair Holey Factorizations with Prescribed Regularity.
Electron. J. Comb., 2017

Revisiting the intersection problem for minimum coverings of complete graphs with triples.
Australas. J Comb., 2017

Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs.
Graphs Comb., 2016

On the embedding of partial three path designs.
Discret. Math., 2016

Equitable block-colorings of C<sub>4</sub>-decompositions of K<sub>v</sub>-F.
Discret. Math., 2016

Total-colorings of complete multipartite graphs using amalgamations.
Discret. Math., 2016

4-Cycle Systems of K<sub>n</sub>-E(F<sup>*</sup>).
Graphs Comb., 2015

The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency.
Graphs Comb., 2015

Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs.
Discret. Math., 2015

Decomposition of the Kneser Graph into paths of length four.
Discret. Math., 2015

Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames.
Discret. Math., 2015

Enclosings of λ-fold 5-cycle systems for u=2.
Discret. Math., 2015

Embedding Factorizations for 3-Uniform Hypergraphs.
J. Graph Theory, 2013

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

Group divisible designs with two associate classes, and quadratic leaves of triple systems.
Discret. Math., 2013

Multiply balanced edge colorings of multigraphs.
J. Graph Theory, 2012

Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice.
Discret. Math., 2012

Path Decompositions Which Contain No Proper Subsystems.
Ars Comb., 2012

C<sub>4</sub>-factorizations with two associate classes, λ<sub>1</sub> is odd.
Australas. J Comb., 2011

Gregarious GDDs with Two Associate Classes.
Graphs Comb., 2010

Hamilton decompositions of balanced complete multipartite graphs with primitive leaves.
Discret. Math., 2010

Enclosings of <i>lambda</i>-fold 4-cycle systems.
Des. Codes Cryptogr., 2010

Hamilton decompositions of graphs with primitive complements.
Discret. Math., 2009

Embedding Steiner triple systems in hexagon triple systems.
Discret. Math., 2009

Diagonally switchable 4-cycle systems revisited.
Australas. J Comb., 2009

Embedding Partial 4-cycle Systems of Arbitrary Index.
Graphs Comb., 2008

Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs.
Graphs Comb., 2008

Maximal sets of hamilton cycles in K<sub>2p</sub>-F.
Discret. Math., 2008

All graphs with maximum degree three whose complements have 4-cycle decompositions.
Discret. Math., 2008

Resolvable 4-cycle group divisible designs with two associate classes: Part size even.
Discret. Math., 2008

Resolvable gregarious cycle decompositions of complete equipartite graphs.
Discret. Math., 2008

C<sub>4</sub>-factorizations with two associate classes.
Australas. J Comb., 2008

Decompositions of <i>lambda</i> <i>K</i> <sub> <i>v</i> </sub>.
J. Comb. Optim., 2007

Maximal sets of Hamilton cycles in complete multipartite graphs II.
Australas. J Comb., 2007

2-Regular leaves of partial 8-cycle systems.
Australas. J Comb., 2007

A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9.
Ars Comb., 2006

Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles.
Graphs Comb., 2005

All 2-Regular Leaves of Partial 6-cycle Systems.
Ars Comb., 2005

Hamilton decompositions of complete bipartite graphs with a 3-factor leave.
Australas. J Comb., 2005

Hamilton Decomposable Graphs with Specified Leaves.
Graphs Comb., 2004

Discret. Math., 2004

Embedding coverings of 2-paths with 3-paths.
Discret. Math., 2004

Hamilton decompositions of complete graphs with a 3-factor leave.
Discret. Math., 2004

Decomposing <i>K<sub>n</sub></i>cup<i>P</i> into triangles.
Discret. Math., 2004

A solution to the forest leave problem for partial 6-cycle systems.
Discret. Math., 2004

Hamilton decompositions of complete multipartite graphs with any 2-factor leave.
J. Graph Theory, 2003

Maximal sets of hamilton cycles in complete multipartite graphs.
J. Graph Theory, 2003

Hamiltonian double latin squares.
J. Comb. Theory, Ser. B, 2003

Amalgamations of connected k-factorizations.
J. Comb. Theory, Ser. B, 2003

A connection between varieties of quasigroups and graph decompositions.
Discret. Math., 2003

A partial 2<i>k</i>-cycle system of order <i>n</i> can be embedded in a 2<i>k</i>-cycle system of order <i>kn</i>+<i>c(k)</i>, <i>k</i>geq3, where <i>c(k)</i> is a quadratic function of <i>k</i>.
Discret. Math., 2003

Fair Hamilton Decompositions of Complete Multipartite Graphs.
J. Comb. Theory, Ser. B, 2002

Coloring the Vertices of a Graph With Measurable Sets in a Probability Space.
Electron. Notes Discret. Math., 2002

Path coverings with paths.
J. Graph Theory, 2001

Four-Cycle Systems with Two-Regular Leaves.
Graphs Comb., 2001

4-Cycle Group-Divisible Designs with Two Associate Classes.
Comb. Probab. Comput., 2001

Forest leaves and four-cycles.
J. Graph Theory, 2000

Maximal sets of Hamilton cycles in <i>K<sub>n, n</sub></i>.
J. Graph Theory, 2000

An <i>n</i> to <i>2n</i> embedding of incomplete idempotent latin squares for small values of<i>n</i>.
Discret. Math., 2000

(k, g)-cages are 3-connected.
Discret. Math., 1999

Embedding Partial Extended Triple Systems when l >= 2.
Ars Comb., 1999

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

Almost Resolvable Directed m-cycle systems: m = 3 (mod 6).
Ars Comb., 1999

Group Divisible Designs with Two Associate Classes: n=2 orm=2.
J. Comb. Theory, Ser. A, 1998

Two Doyen-Wilson theorems for maximum packings with triples.
Discret. Math., 1998

The directed almost resolvable Hamilton-Waterloo problem.
Australas. J Comb., 1998

Connectivity of cages.
J. Graph Theory, 1997

Embedding partial extended triple systems and totally symmetric quasigroups.
Discret. Math., 1997

On equationally defining extended cycle systems<sup>, </sup>.
Discret. Math., 1997

Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14.
Discret. Math., 1997

Factorizations of complete multigraphs.
Australas. J Comb., 1997

Cycle systems of the line graph of the complete graph.
J. Graph Theory, 1996

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs.
Discret. Math., 1996

5-Cycle Systems with Holes.
Des. Codes Cryptogr., 1996

Embedding edge-colorings into 2-edge-connected <i>k</i>-factorizations of <i>k<sub>kn+1</sub></i>.
J. Graph Theory, 1995

Blocking set preserving embeddings of partial K<sub>4</sub>, -, e designs.
Australas. J Comb., 1995

The Doyen-Wilson Theorem Extended to 5-Cycles.
J. Comb. Theory, Ser. A, 1994

Linear spaces with many small lines.
Discret. Math., 1994

Maximal Sets of 2-Factors and Hamiltonian Cycles.
J. Comb. Theory, Ser. B, 1993

Cycle Decompositions of the Line Graph of K<sub>n</sub>.
J. Comb. Theory, Ser. A, 1993

Nesting partial Steiner triple systems with 2-regular leave graphs.
Discret. Math., 1993

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

The chromatic index of complete multipartite graphs.
J. Graph Theory, 1992

Directed star decompositions of the complete directed graph.
J. Graph Theory, 1992

Nesting directed cycle systems of even length.
Eur. J. Comb., 1992

2-perfect m-cycle systems.
Discret. Math., 1992

Constructions of perfect Mendelsohn designs.
Discret. Math., 1992

Existence of perfect Mendelsohn designs with k=5 and lambda>1.
Discret. Math., 1992

The spectrum for 2-perfect 6-cycle systems.
J. Comb. Theory, Ser. A, 1991

The embedding of partial triple systems when 4 divides lambda.
J. Comb. Theory, Ser. A, 1991

Directed star decompositions of directed multigraphs.
Discret. Math., 1991

The intersection problem for minimum coverings of K<sub>n</sub> by triples.
Australas. J Comb., 1991

2-colouring K<sub>4</sub>-e designs.
Australas. J Comb., 1991

Small embeddings for partial cycle systems of odd length.
Discret. Math., 1990

Limiting error propagation in Viterbi decoding of convolutional codes.
IEEE Trans. Inf. Theory, 1989

On the construction of odd cycle systems.
J. Graph Theory, 1989

Nesting of cycle systems of odd length.
Discret. Math., 1989

Class one graphs.
J. Comb. Theory, Ser. B, 1988

Almost resolvable decompositions of 2<i>K</i><sub><i>n</i></sub> into cycles of odd length.
J. Comb. Theory, Ser. A, 1988

Nesting and Almost Resolvability of Pentagon Systems.
Eur. J. Comb., 1988

Embedding partial triple systems.
J. Comb. Theory, Ser. A, 1987

Embedding partial Mendelsohn triple systems.
Discret. Math., 1987

Hamiltonian decompositions of complete regular s-partite graphs.
Discret. Math., 1986

Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambda.
J. Comb. Theory, Ser. A, 1984

Embedding an incomplete latin square in a latin square with a prescribed diagonal.
Discret. Math., 1984

Explicit Kerdock codes over GF(2).
Proceedings of the Applied Algebra, 1984