C. A. Rodger - RankMe

48 papers Journal 47Unranked 1

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