Follow
C A Rodger
Title
Cited by
Cited by
Year
Design theory
CC Lindner, CA Rodger
Chapman and Hall/CRC, 2017
4102017
Decomposition into cycles II: Cycle systems
CC Lindner, CA Rodger
Contemporary design theory: a collection of surveys, 325-369, 1992
1931992
Distance magic labelings of graphs
M Miller, C Rodger, R Simanjuntak
Australasian journal of combinatorics 28, 305-315, 2003
1882003
Coding theory: the essentials
DG Hoffman, Wal, DA Leonard, CC Lidner, KT Phelps, CA Rodger
Marcel Dekker, Inc., 1991
1791991
Coding theory and cryptography: the essentials
DC Hankerson, G Hoffman, DA Leonard, CC Lindner, KT Phelps, ...
CRC Press, 2000
1562000
The chromatic index of complete multipartite graphs
DG Hoffman, CA Rodger
Journal of Graph Theory 16 (2), 159-163, 1992
1071992
On the construction of odd cycle systems
DG Hoffman, CC Lindner, CA Rodger
Journal of graph theory 13 (4), 417-426, 1989
1001989
Cycle decompositions
D Bryant, C Rodger
Handbook of combinatorial designs, 399-407, 2006
902006
Connectivity of cages
HL Fu, KC Huang, CA Rodger
Journal of Graph Theory 24 (2), 187-191, 1997
721997
Group Divisible Designs with Two Associate Classes: n= 2 orm= 2
HL Fu, CA Rodger
Journal of Combinatorial Theory, Series A 83 (1), 94-117, 1998
671998
Graph decomposition
CA Rodger
Le Matematiche 45 (1), 119-140, 1990
661990
Hamiltonian decompositions of complete regular s-partite graphs
AJW Hilton, CA Rodger
Discrete mathematics 58 (1), 63-78, 1986
661986
The existence of group divisible designs with first and second associates, having block size 3
HL Fu, CA Rodger, DG Sarvate
Ars Combinatoria 54, 33-50, 2000
552000
The spectrum for 2-perfect 6-cycle systems
CC Lindner, KT Phelps, CA Rodger
Journal of Combinatorial Theory, Series A 57 (1), 76-85, 1991
471991
(k, g)-cages are 3-connected
M Daven, CA Rodger
Discrete mathematics 199 (1-3), 207-215, 1999
441999
On inequivalent weighing matrices
HC Chan, CA Rodger, J Seberry
401986
2-perfect m-cycle systems
CC Lindner, CA Rodger
Discrete mathematics 104 (1), 83-90, 1992
391992
Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of kkn+1
CA Rodger, EB Wantland
Journal of Graph Theory 19 (2), 169-185, 1995
361995
Constructions of perfect Mendelsohn designs
FE Bennett, KT Phelps, CA Rodger, L Zhu
Discrete mathematics 103 (2), 139-151, 1992
361992
A solution to the embedding problem for partial idempotent Latin squares
LD Andersen, AJW Hilton, CA Rodger
Journal of the London Mathematical Society 2 (1), 21-27, 1982
361982
The system can't perform the operation now. Try again later.
Articles 1–20