C. A. Rodger

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 8

Top Topics

Image Decomposition

Graph Theoretic

Top Venues

Discret. Appl. Math.

J. Graph Theory

Publications

Aseem Dalal, Bhawani Sankar Panda, C. A. Rodger
Total colorings of complete multipartite graphs using amalgamations. Discret. Appl. Math. 359 (2024)
David M. Tidwell, C. A. Rodger
Maximal sets of Hamilton cycles in complete multipartite graphs IV. Discret. Math. 345 (8) (2022)
Mustafa Demir, C. A. Rodger
Embedding an edge-coloring of K(nr;λ1, λ2) into a Hamiltonian decomposition of K(nr+2;λ1, λ2). J. Graph Theory 93 (1) (2020)
Aras Erzurumluoglu, C. A. Rodger
Fair and internally fair (holey) hamiltonian decompositions of. Discret. Math. 341 (2) (2018)
E. B. Matson, C. A. Rodger
More extreme equitable colorings of decompositions of Kv and Kv-F. Discret. Math. 341 (4) (2018)
Hung-Lin Fu, Yuan-Hsun Lo, K. E. Perry, C. A. Rodger
On the number of rainbow spanning trees in edge-colored complete graphs. Discret. Math. 341 (8) (2018)
Aseem Dalal, B. S. Panda, C. A. Rodger
Total-colorings of complete multipartite graphs using amalgamations. Discret. Math. 339 (5) (2016)
Shanhai Li, C. A. Rodger
-F. Discret. Math. 339 (5) (2016)
John Asplund, C. A. Rodger, Melissa S. Keranen
Enclosings of λ-fold 5-cycle systems for u=2. Discret. Math. 338 (5) (2015)
T. R. Whitt III, C. A. Rodger
Decomposition of the Kneser Graph into paths of length four. Discret. Math. 338 (8) (2015)
Aseem Dalal, C. A. Rodger
The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency. Graphs Comb. 31 (6) (2015)
Nidhi Sehgal, C. A. Rodger
). Graphs Comb. 31 (5) (2015)
Aras Erzurumluoglu, C. A. Rodger
Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames. Discret. Math. 338 (7) (2015)
Hongtao Zhao, C. A. Rodger
Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs. Discret. Math. 338 (8) (2015)
M. Amin Bahmanian, C. A. Rodger
Embedding an Edge-colored K(a (p); λ, μ) into a Hamiltonian Decomposition of K(a (p+r); λ, μ). Graphs Comb. 29 (4) (2013)
Joe Chaffee, C. A. Rodger
Group divisible designs with two associate classes, and quadratic leaves of triple systems. Discret. Math. 313 (20) (2013)
Chandra Dinavahi, C. A. Rodger
Path Decompositions Which Contain No Proper Subsystems. Ars Comb. 107 (2012)
M. Amin Bahmanian, C. A. Rodger
Multiply balanced edge colorings of multigraphs. J. Graph Theory 70 (3) (2012)
Atif A. Abueida, C. A. Rodger
Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice. Discret. Math. 312 (22) (2012)
N. A. Newman, C. A. Rodger
-fold 4-cycle systems. Des. Codes Cryptogr. 55 (2-3) (2010)
Sibel Özkan, C. A. Rodger
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves. Discret. Math. 310 (13-14) (2010)
Sibel Özkan, C. A. Rodger
Hamilton decompositions of graphs with primitive complements. Discret. Math. 309 (14) (2009)
April Parker, C. A. Rodger
Embedding Partial 4-cycle Systems of Arbitrary Index. Graphs Comb. 24 (4) (2008)
L. McCauley, C. A. Rodger
Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs. Graphs Comb. 24 (1) (2008)
C. A. Rodger, S. K. Westbrook
. J. Comb. Optim. 14 (2-3) (2007)
C. A. Rodger
Hamilton Decomposable Graphs with Specified Leaves. Graphs Comb. 20 (4) (2004)
C. David Leach, C. A. Rodger
Hamilton decompositions of complete multipartite graphs with any 2-factor leave. J. Graph Theory 44 (3) (2003)
Mike Daven, Jim A. MacDougall, C. A. Rodger
Maximal sets of hamilton cycles in complete multipartite graphs. J. Graph Theory 43 (1) (2003)
H. L. Fu, C. A. Rodger
4-Cycle Group-Divisible Designs with Two Associate Classes. Comb. Probab. Comput. 10 (4) (2001)
Mike Daven, C. A. Rodger
(k, g)-cages are 3-connected. Discret. Math. 199 (1-3) (1999)
H. L. Fu, Charles C. Lindner, C. A. Rodger
Two Doyen-Wilson theorems for maximum packings with triples. Discret. Math. 178 (1-3) (1998)
Dean G. Hoffman, C. A. Rodger
On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs. Discret. Math. 160 (1-3) (1996)
B. A. Cox, C. A. Rodger
Cycle systems of the line graph of the complete graph. J. Graph Theory 21 (2) (1996)
Charles C. Lindner, C. A. Rodger
, -, e designs. Australas. J Comb. 12 (1995)
C. A. Rodger, Evan B. Wantland
. J. Graph Theory 19 (2) (1995)
C. A. Rodger
Linear spaces with many small lines. Discret. Math. 129 (1-3) (1994)
Charles 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. Discret. Math. 117 (1-3) (1993)
M. Colby, C. A. Rodger
. J. Comb. Theory, Ser. A 62 (1) (1993)
Charles C. Lindner, C. A. Rodger
2-perfect m-cycle systems. Discret. Math. 104 (1) (1992)
Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger
Directed star decompositions of the complete directed graph. J. Graph Theory 16 (5) (1992)
Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger
Directed star decompositions of directed multigraphs. Discret. Math. 97 (1-3) (1991)
Mario Gionfriddo, Charles C. Lindner, C. A. Rodger
-e designs. Australas. J Comb. 3 (1991)
Charles C. Lindner, Eric Mendelsohn, C. A. Rodger
by triples. Australas. J Comb. 4 (1991)
Douglas A. Leonard, C. A. Rodger
Limiting error propagation in Viterbi decoding of convolutional codes. IEEE Trans. Inf. Theory 35 (6) (1989)
C. A. Rodger
Embedding partial Mendelsohn triple systems. Discret. Math. 65 (2) (1987)
Douglas A. Leonard, C. A. Rodger
Explicit Kerdock codes over GF(2). AAECC (1984)
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) (1984)
C. A. Rodger
Embedding an incomplete latin square in a latin square with a prescribed diagonal. Discret. Math. 51 (1) (1984)