C. A. Rodger - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 48 from 48

2022

Maximal sets of Hamilton cycles in complete multipartite graphs IVDavid M. Tidwell, C. A. Rodger. DM, 345(8):112932, 2022. [doi]

2020

Embedding an edge-coloring of K(nr;λ1, λ2) into a Hamiltonian decomposition of K(nr+2;λ1, λ2)Mustafa Demir, C. A. Rodger. jgt, 93(1):49-63, 2020. [doi]

2018

Fair and internally fair (holey) hamiltonian decompositions ofAras Erzurumluoglu, C. A. Rodger. DM, 341(2):315-323, 2018. [doi]

On the number of rainbow spanning trees in edge-colored complete graphsHung-Lin Fu, Yuan-Hsun Lo, K. E. Perry, C. A. Rodger. DM, 341(8):2343-2352, 2018. [doi]

Extreme equitable block colorings of $C_4$-decompositions of $K_v-F$S. Li, E. B. Matson, C. A. Rodger. ajc, 71:92-103, 2018. [doi]

More extreme equitable colorings of decompositions of Kv and Kv-FE. B. Matson, C. A. Rodger. DM, 341(4):1178-1184, 2018. [doi]

2016

Total-colorings of complete multipartite graphs using amalgamationsAseem Dalal, B. S. Panda, C. A. Rodger. DM, 339(5):1587-1592, 2016. [doi]

v-FShanhai Li, C. A. Rodger. DM, 339(5):1519-1524, 2016. [doi]

2015

Enclosings of λ-fold 5-cycle systems for u=2John Asplund, C. A. Rodger, Melissa S. Keranen. DM, 338(5):743-765, 2015. [doi]

The Total Chromatic Number of Complete Multipartite Graphs with Low DeficiencyAseem Dalal, C. A. Rodger. gc, 31(6):2159-2173, 2015. [doi]

Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle framesAras Erzurumluoglu, C. A. Rodger. DM, 338(7):1173-1177, 2015. [doi]

Decomposition of the Kneser Graph into paths of length fourT. R. Whitt III, C. A. Rodger. DM, 338(8):1284-1288, 2015. [doi]

*)Nidhi Sehgal, C. A. Rodger. gc, 31(5):1703-1714, 2015. [doi]

Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphsHongtao Zhao, C. A. Rodger. DM, 338(8):1407-1415, 2015. [doi]

2013

Embedding an Edge-colored K(a (p); λ, μ) into a Hamiltonian Decomposition of K(a (p+r); λ, μ)M. Amin Bahmanian, C. A. Rodger. gc, 29(4):747-755, 2013. [doi]

Group divisible designs with two associate classes, and quadratic leaves of triple systemsJoe Chaffee, C. A. Rodger. DM, 313(20):2104-2114, 2013. [doi]

2012

Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions sufficeAtif A. Abueida, C. A. Rodger. DM, 312(22):3328-3334, 2012. [doi]

Multiply balanced edge colorings of multigraphsM. Amin Bahmanian, C. A. Rodger. jgt, 70(3):297-317, 2012. [doi]

Path Decompositions Which Contain No Proper SubsystemsChandra Dinavahi, C. A. Rodger. arscom, 107:33-49, 2012.

2010

Enclosings of ::::lambda::::-fold 4-cycle systemsN. A. Newman, C. A. Rodger. dcc, 55(2-3):297-310, 2010. [doi]

Hamilton decompositions of balanced complete multipartite graphs with primitive leavesSibel Ozkan, C. A. Rodger. DM, 310(13-14):1965-1973, 2010. [doi]

2009

Hamilton decompositions of graphs with primitive complementsSibel Ozkan, C. A. Rodger. DM, 309(14):4883-4888, 2009. [doi]

2008

Hamilton Cycle Rich 2-factorizations of Complete Multipartite GraphsL. McCauley, C. A. Rodger. gc, 24(1):47-52, 2008. [doi]

Embedding Partial 4-cycle Systems of Arbitrary IndexApril Parker, C. A. Rodger. gc, 24(4):367-371, 2008. [doi]

2007

Decompositions of ::::lambda:::: ::::K:::: :: ::::v:::: ::C. A. Rodger, S. K. Westbrook. jco, 14(2-3):259-265, 2007. [doi]

2004

Hamilton Decomposable Graphs with Specified LeavesC. A. Rodger. gc, 20(4):541-543, 2004. [doi]

2003

Maximal sets of hamilton cycles in complete multipartite graphsMike Daven, Jim A. MacDougall, C. A. Rodger. jgt, 43(1):49-66, 2003. [doi]

Hamilton decompositions of complete multipartite graphs with any 2-factor leaveC. David Leach, C. A. Rodger. jgt, 44(3):208-214, 2003. [doi]

2001

4-Cycle Group-Divisible Designs with Two Associate ClassesH. L. Fu, C. A. Rodger. cpc, 10(4):317-343, 2001. [doi]

1999

(k, g)-cages are 3-connectedMike Daven, C. A. Rodger. DM, 199(1-3):207-215, 1999. [doi]

1998

Two Doyen-Wilson theorems for maximum packings with triplesH. L. Fu, Charles C. Lindner, C. A. Rodger. DM, 178(1-3):63-71, 1998. [doi]

1996

Cycle systems of the line graph of the complete graphB. A. Cox, C. A. Rodger. jgt, 21(2):173-182, 1996. [doi]

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphsDean G. Hoffman, C. A. Rodger. DM, 160(1-3):177-187, 1996. [doi]

1995

4, -, e designsC. C. Lindner, C. A. Rodger. ajc, 12:121-126, 1995. [doi]

kn+1C. A. Rodger, Evan B. Wantland. jgt, 19(2):169-185, 1995. [doi]

1994

Linear spaces with many small linesC. A. Rodger. DM, 129(1-3):167-180, 1994. [doi]

1993

Cycle Decompositions of the Line Graph of K::n::M. Colby, C. A. Rodger. JCT, 62(1):158-161, 1993.

A partial m=(2k+1)-cycle system of order n can be embedded in an m-cycle system of order (2n+1)mCharles C. Lindner, C. A. Rodger. DM, 117(1-3):151-159, 1993. [doi]

1992

Directed star decompositions of the complete directed graphCharles J. Colbourn, Dean G. Hoffman, C. A. Rodger. jgt, 16(5):517-528, 1992. [doi]

2-perfect m-cycle systemsCharles C. Lindner, C. A. Rodger. DM, 104(1):83-90, 1992. [doi]

1991

Directed star decompositions of directed multigraphsCharles J. Colbourn, Dean G. Hoffman, C. A. Rodger. DM, 97(1-3):139-148, 1991. [doi]

4-e designsMario Gionfriddo, C. C. Lindner, C. A. Rodger. ajc, 3:211-230, 1991. [doi]

n by triplesC. C. Lindner, Eric Mendelsohn, C. A. Rodger. ajc, 4:179-198, 1991. [doi]

1989

Limiting error propagation in Viterbi decoding of convolutional codesDouglas A. Leonard, C. A. Rodger. TIT, 35(6):1295, 1989.

1987

Embedding partial Mendelsohn triple systemsC. A. Rodger. DM, 65(2):187-196, 1987. [doi]

1984

Small Embeddings of Partial Directed Triple Systems and Partial Triple Systems with Even lambdaCharles J. Colbourn, Rose C. Hamm, C. A. Rodger. JCT, 37(3):363-369, 1984.

Explicit Kerdock codes over GF(2)Douglas A. Leonard, C. A. Rodger. AAECC 1986: 130-135

Embedding an incomplete latin square in a latin square with a prescribed diagonalC. A. Rodger. DM, 51(1):73-89, 1984. [doi]

Sign in or sign up to see more results.

runs on WebDSL