default search action
Christopher A. Rodger
C. A. Rodger
Person information
- affiliation: Auburn University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j115]Aseem Dalal, Bhawani Sankar Panda, C. A. Rodger:
Total colorings of complete multipartite graphs using amalgamations. Discret. Appl. Math. 359: 186-195 (2024) - 2022
- [j114]Lars Døvling Andersen, Stacie Baumann
, Anthony J. W. Hilton, Christopher A. Rodger:
On Completing Partial Latin Squares with Prescribed Diagonals. Electron. J. Comb. 29(3) (2022) - [j113]David M. Tidwell
Maximal sets of Hamilton cycles in complete multipartite graphs IV. Discret. Math. 345(8): 112932 (2022) - 2020
- [j112]Mustafa Demir
Maximal sets of Hamilton cycles in Knr;λ1, λ2. Discret. Math. 343(10): 112010 (2020) - [j111]Mustafa Demir
Embedding an edge-coloring of K(nr;λ1, λ2) into a Hamiltonian decomposition of K(nr+2;λ1, λ2). J. Graph Theory 93(1): 49-63 (2020)
2010 – 2019
- 2018
- [j110]Shanhai Li, Elizabeth Bailey Matson, Christopher A. Rodger:
Extreme equitable block colorings of C4-decompositions of Kv-F. Australas. J Comb. 71: 92-103 (2018) - [j109]Aras Erzurumluoglu, C. A. Rodger:
Fair and internally fair (holey) hamiltonian decompositions of. Discret. Math. 341(2): 315-323 (2018) - [j108]Elizabeth Bailey Matson, C. A. Rodger:
More extreme equitable colorings of decompositions of Kv and Kv-F. Discret. Math. 341(4): 1178-1184 (2018) - [j107]Hung-Lin Fu, Yuan-Hsun Lo
On the number of rainbow spanning trees in edge-colored complete graphs. Discret. Math. 341(8): 2343-2352 (2018) - [c2]Elizabeth Bailey Matson
Amalgamations and Equitable Block-Colorings. ICMC 2018: 42-50 - 2017
- [j106]Charles C. Lindner, Christopher A. Rodger, Mariusz Meszka:
Revisiting the intersection problem for minimum coverings of complete graphs with triples. Australas. J Comb. 68: 276-284 (2017) - [j105]Aras Erzurumluoglu, Christopher A. Rodger:
Internally Fair Factorizations and Internally Fair Holey Factorizations with Prescribed Regularity. Electron. J. Comb. 24(3): 3 (2017) - 2016
- [j104]T. R. Whitt III, Christopher A. Rodger:
On the embedding of partial three path designs. Discret. Math. 339(5): 1476-1481 (2016) - [j103]Shanhai Li, C. A. Rodger:
Equitable block-colorings of C4-decompositions of Kv-F. Discret. Math. 339(5): 1519-1524 (2016) - [j102]Aseem Dalal, B. S. Panda, C. A. Rodger:
Total-colorings of complete multipartite graphs using amalgamations. Discret. Math. 339(5): 1587-1592 (2016) - [j101]Aras Erzurumluoglu, Christopher A. Rodger:
Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs. Graphs Comb. 32(4): 1375-1388 (2016) - 2015
- [j100]John Asplund, C. A. Rodger, Melissa S. Keranen:
Enclosings of λ-fold 5-cycle systems for u=2. Discret. Math. 338(5): 743-765 (2015) - [j99]Aras Erzurumluoglu, C. A. Rodger:
Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames. Discret. Math. 338(7): 1173-1177 (2015) - [j98]T. R. Whitt III, C. A. Rodger:
Decomposition of the Kneser Graph into paths of length four. Discret. Math. 338(8): 1284-1288 (2015) - [j97]Hongtao Zhao, C. A. Rodger:
Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs. Discret. Math. 338(8): 1407-1415 (2015) - [j96]Nidhi Sehgal, C. A. Rodger:
4-Cycle Systems of Kn-E(F*). Graphs Comb. 31(5): 1703-1714 (2015) - [j95]Aseem Dalal, C. A. Rodger:
The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency. Graphs Comb. 31(6): 2159-2173 (2015) - 2013
- [j94]Joe Chaffee, C. A. Rodger:
Group divisible designs with two associate classes, and quadratic leaves of triple systems. Discret. Math. 313(20): 2104-2114 (2013) - [j93]M. Amin Bahmanian
Embedding an Edge-colored K(a (p); λ, μ) into a Hamiltonian Decomposition of K(a (p+r); λ, μ). Graphs Comb. 29(4): 747-755 (2013) - [j92]M. Amin Bahmanian
Embedding Factorizations for 3-Uniform Hypergraphs. J. Graph Theory 73(2): 216-224 (2013) - 2012
- [j91]Chandra Dinavahi, C. A. Rodger:
Path Decompositions Which Contain No Proper Subsystems. Ars Comb. 107: 33-49 (2012) - [j90]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): 3328-3334 (2012) - [j89]M. Amin Bahmanian
Multiply balanced edge colorings of multigraphs. J. Graph Theory 70(3): 297-317 (2012) - 2011
- [j88]Christopher A. Rodger, Michael A. Tiemeyer:
C4-factorizations with two associate classes, λ1 is odd. Australas. J Comb. 50: 259- (2011) - 2010
- [j87]N. A. Newman, C. A. Rodger:
Enclosings of lambda-fold 4-cycle systems. Des. Codes Cryptogr. 55(2-3): 297-310 (2010) - [j86]Sibel Özkan
Hamilton decompositions of balanced complete multipartite graphs with primitive leaves. Discret. Math. 310(13-14): 1965-1973 (2010) - [j85]Saad I. El-Zanati, Narong Punnim, Christopher A. Rodger:
Gregarious GDDs with Two Associate Classes. Graphs Comb. 26(6): 775-780 (2010)
2000 – 2009
- 2009
- [j84]Chandra Dinavahi, Christopher A. Rodger:
Diagonally switchable 4-cycle systems revisited. Australas. J Comb. 43: 231-236 (2009) - [j83]Charles Curtis Lindner, Gaetano Quattrocchi, Christopher A. Rodger:
Embedding Steiner triple systems in hexagon triple systems. Discret. Math. 309(2): 487-490 (2009) - [j82]Sibel Özkan
Hamilton decompositions of graphs with primitive complements. Discret. Math. 309(14): 4883-4888 (2009) - 2008
- [j81]Christopher A. Rodger, Michael A. Tiemeyer:
C4-factorizations with two associate classes. Australas. J Comb. 40: 217-228 (2008) - [j80]Elizabeth J. Billington, Christopher A. Rodger:
Resolvable 4-cycle group divisible designs with two associate classes: Part size even. Discret. Math. 308(2-3): 303-307 (2008) - [j79]Hung-Lin Fu, S. L. Logan, Christopher A. Rodger:
Maximal sets of hamilton cycles in K2p-F. Discret. Math. 308(13): 2822-2829 (2008) - [j78]Elizabeth J. Billington, Dean G. Hoffman, Christopher A. Rodger:
Resolvable gregarious cycle decompositions of complete equipartite graphs. Discret. Math. 308(13): 2844-2853 (2008) - [j77]Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith:
All graphs with maximum degree three whose complements have 4-cycle decompositions. Discret. Math. 308(13): 2901-2909 (2008) - [j76]L. McCauley, C. A. Rodger:
Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs. Graphs Comb. 24(1): 47-52 (2008) - [j75]April Parker, C. A. Rodger:
Embedding Partial 4-cycle Systems of Arbitrary Index. Graphs Comb. 24(4): 367-371 (2008) - 2007
- [j74]David James Ashe, C. David Leach, Christopher A. Rodger:
2-Regular leaves of partial 8-cycle systems. Australas. J Comb. 39: 3-18 (2007) - [j73]Sasha Logan Jarrell, Christopher A. Rodger:
Maximal sets of Hamilton cycles in complete multipartite graphs II. Australas. J Comb. 39: 207-218 (2007) - [j72]C. A. Rodger, S. K. Westbrook:
Decompositions of lambda K v . J. Comb. Optim. 14(2-3): 259-265 (2007) - 2006
- [j71]Selda Küçükçifçi, Curt Lindner, Christopher A. Rodger:
A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9. Ars Comb. 79 (2006) - 2005
- [j70]Darryn E. Bryant, C. David Leach, Christopher A. Rodger:
Hamilton decompositions of complete bipartite graphs with a 3-factor leave. Australas. J Comb. 31: 331-336 (2005) - [j69]David James Ashe, Christopher A. Rodger, Hung-Lin Fu:
All 2-Regular Leaves of Partial 6-cycle Systems. Ars Comb. 76 (2005) - [j68]Peter D. Johnson Jr., Christopher A. Rodger:
Coloring the vertices of a graph with measurable sets in a probability space. Eur. J. Comb. 26(2): 251-257 (2005) - [j67]Elizabeth J. Billington, Hung-Lin Fu, Christopher A. Rodger:
Packing lambda-Fold Complete Multipartite Graphs with 4-Cycles. Graphs Comb. 21(2): 169-186 (2005) - 2004
- [j66]C. David Leach, Christopher A. Rodger:
Hamilton decompositions of complete graphs with a 3-factor leave. Discret. Math. 279(1-3): 337-344 (2004) - [j65]David James Ashe, Hung-Lin Fu, Christopher A. Rodger:
A solution to the forest leave problem for partial 6-cycle systems. Discret. Math. 281(1-3): 27-41 (2004) - [j64]Christopher A. Rodger, Dean G. Hoffman:
Preface. Discret. Math. 284(1-3): 1-7 (2004) - [j63]Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger:
Decomposing KncupP into triangles. Discret. Math. 284(1-3): 131-136 (2004) - [j62]J. W. McGee, Christopher A. Rodger:
Embedding coverings of 2-paths with 3-paths. Discret. Math. 284(1-3): 217-223 (2004) - [j61]C. A. Rodger:
Hamilton Decomposable Graphs with Specified Leaves. Graphs Comb. 20(4): 541-543 (2004) - 2003
- [j60]Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger:
A partial 2k-cycle system of order n can be embedded in a 2k-cycle system of order kn+c(k), kgeq3, where c(k) is a quadratic function of k. Discret. Math. 261(1-3): 325-336 (2003) - [j59]Charles Curtis Lindner, Christopher A. Rodger:
A connection between varieties of quasigroups and graph decompositions. Discret. Math. 272(2-3): 127-137 (2003) - [j58]Anthony J. W. Hilton, Michael E. Mays, Christopher A. Rodger, Crispin St. John Alvah Nash-Williams:
Hamiltonian double latin squares. J. Comb. Theory B 87(1): 81-129 (2003) - [j57]Anthony J. W. Hilton, Matthew Johnson
Amalgamations of connected k-factorizations. J. Comb. Theory B 88(2): 267-279 (2003) - [j56]Mike Daven, Jim A. MacDougall, C. A. Rodger:
Maximal sets of hamilton cycles in complete multipartite graphs. J. Graph Theory 43(1): 49-66 (2003) - [j55]C. David Leach, C. A. Rodger:
Hamilton decompositions of complete multipartite graphs with any 2-factor leave. J. Graph Theory 44(3): 208-214 (2003) - 2002
- [j54]Peter D. Johnson Jr., Christopher A. Rodger:
Coloring the Vertices of a Graph With Measurable Sets in a Probability Space. Electron. Notes Discret. Math. 11: 417-424 (2002) - [j53]C. David Leach, Christopher A. Rodger:
Fair Hamilton Decompositions of Complete Multipartite Graphs. J. Comb. Theory B 85(2): 290-296 (2002) - 2001
- [j52]H. L. Fu, C. A. Rodger:
4-Cycle Group-Divisible Designs with Two Associate Classes. Comb. Probab. Comput. 10(4): 317-343 (2001) - [j51]H. L. Fu, Christopher A. Rodger:
Four-Cycle Systems with Two-Regular Leaves. Graphs Comb. 17(3): 457-461 (2001) - [j50]J. W. McGee, Christopher A. Rodger:
Path coverings with paths. J. Graph Theory 36(3): 156-167 (2001) - 2000
- [j49]Carrie E. A. Grant, Christopher A. Rodger:
An n to 2n embedding of incomplete idempotent latin squares for small values ofn. Discret. Math. 211: 53-74 (2000) - [j48]Darryn E. Bryant, Saad I. El-Zanati, Christopher A. Rodger:
Maximal sets of Hamilton cycles in Kn, n. J. Graph Theory 33(1): 25-31 (2000) - [j47]Hung-Lin Fu, Christopher A. Rodger:
Forest leaves and four-cycles. J. Graph Theory 33(3): 161-166 (2000)
1990 – 1999
- 1999
- [j46]Hung-Lin Fu, Christopher A. Rodger:
Almost Resolvable Directed m-cycle systems: m = 3 (mod 6). Ars Comb. 53 (1999) - [j45]Michael Edwin Raines, Christopher A. Rodger:
Embedding Partial Extended Triple Systems when l >= 2. Ars Comb. 53 (1999) - [j44]Hung-Lin Fu, Christopher A. Rodger, Dinesh G. Sarvate:
The existence of group divisible designs with first and second associates, having block size 3. Ars Comb. 54 (1999) - [j43]Mike Daven, C. A. Rodger:
(k, g)-cages are 3-connected. Discret. Math. 199(1-3): 207-215 (1999) - 1998
- [j42]Italo J. Dejter, David A. Pike, Christopher A. Rodger:
The directed almost resolvable Hamilton-Waterloo problem. Australas. J Comb. 18: 201-208 (1998) - [j41]H. L. Fu, Charles C. Lindner, C. A. Rodger:
Two Doyen-Wilson theorems for maximum packings with triples. Discret. Math. 178(1-3): 63-71 (1998) - [j40]Hung-Lin Fu, Christopher A. Rodger:
Group Divisible Designs with Two Associate Classes: n=2 orm=2. J. Comb. Theory A 83(1): 94-117 (1998) - 1997
- [j39]B. J. Battersby, Darryn E. Bryant, Christopher A. Rodger:
Factorizations of complete multigraphs. Australas. J Comb. 16: 35-44 (1997) - [j38]Darryn E. Bryant
Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. Discret. Math. 171(1-3): 55-75 (1997) - [j37]Charles C. Lindner, Christopher A. Rodger:
On equationally defining extended cycle systems, . Discret. Math. 173(1-3): 1-14 (1997) - [j36]Michael Edwin Raines, Christopher A. Rodger:
Embedding partial extended triple systems and totally symmetric quasigroups. Discret. Math. 176(1-3): 211-222 (1997) - [j35]Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger:
Connectivity of cages. J. Graph Theory 24(2): 187-191 (1997) - 1996
- [j34]Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger:
5-Cycle Systems with Holes. Des. Codes Cryptogr. 8(1-2): 103-108 (1996) - [j33]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): 177-187 (1996) - [j32]B. A. Cox, C. A. Rodger:
Cycle systems of the line graph of the complete graph. J. Graph Theory 21(2): 173-182 (1996) - 1995
- [j31]Charles C. Lindner, C. A. Rodger:
Blocking set preserving embeddings of partial K4, -, e designs. Australas. J Comb. 12: 121-126 (1995) - [j30]C. A. Rodger, Evan B. Wantland:
Embedding edge-colorings into 2-edge-connected k-factorizations of kkn+1. J. Graph Theory 19(2): 169-185 (1995) - 1994
- [j29]C. A. Rodger:
Linear spaces with many small lines. Discret. Math. 129(1-3): 167-180 (1994) - [j28]Darryn E. Bryant, Christopher A. Rodger:
The Doyen-Wilson Theorem Extended to 5-Cycles. J. Comb. Theory A 68(1): 218-225 (1994) - 1993
- [j27]Kevin T. Phelps, Christopher A. Rodger:
Nesting partial Steiner triple systems with 2-regular leave graphs. Discret. Math. 112(1-3): 165-172 (1993) - [j26]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): 151-159 (1993) - [j25]Dean G. Hoffman, Christopher A. Rodger, Alexander Rosa:
Maximal Sets of 2-Factors and Hamiltonian Cycles. J. Comb. Theory B 57(1): 69-76 (1993) - [j24]M. Colby, C. A. Rodger:
Cycle Decompositions of the Line Graph of Kn. J. Comb. Theory A 62(1): 158-161 (1993) - 1992
- [j23]Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, J. Yin, Lie Zhu:
Existence of perfect Mendelsohn designs with k=5 and lambda>1. Discret. Math. 103(2): 129-137 (1992) - [j22]Frank E. Bennett, Kevin T. Phelps, Christopher A. Rodger, Lie Zhu:
Constructions of perfect Mendelsohn designs. Discret. Math. 103(2): 139-151 (1992) - [j21]Charles C. Lindner, C. A. Rodger:
2-perfect m-cycle systems. Discret. Math. 104(1): 83-90 (1992) - [j20]Christopher A. Rodger, Douglas R. Stinson:
Nesting directed cycle systems of even length. Eur. J. Comb. 13(3): 213-218 (1992) - [j19]Dean G. Hoffman, Christopher A. Rodger:
The chromatic index of complete multipartite graphs. J. Graph Theory 16(2): 159-163 (1992) - [j18]Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of the complete directed graph. J. Graph Theory 16(5): 517-528 (1992) - 1991
- [j17]Mario Gionfriddo, Charles C. Lindner, C. A. Rodger:
2-colouring K4-e designs. Australas. J Comb. 3: 211-230 (1991) - [j16]Charles C. Lindner, Eric Mendelsohn, C. A. Rodger:
The intersection problem for minimum coverings of Kn by triples. Australas. J Comb. 4: 179-198 (1991) - [j15]Charles J. Colbourn, Dean G. Hoffman, C. A. Rodger:
Directed star decompositions of directed multigraphs. Discret. Math. 97(1-3): 139-148 (1991) - [j14]Anthony J. W. Hilton, Christopher A. Rodger:
The embedding of partial triple systems when 4 divides lambda. J. Comb. Theory A 56(1): 109-137 (1991) - [j13]Charles Curtis Lindner, Kevin T. Phelps, Christopher A. Rodger:
The spectrum for 2-perfect 6-cycle systems. J. Comb. Theory A 57(1): 76-85 (1991) - 1990
- [j12]Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson:
Small embeddings for partial cycle systems of odd length. Discret. Math. 80(3): 273-280 (1990)
1980 – 1989
- 1989
- [j11]Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson:
Nesting of cycle systems of odd length. Discret. Math. 77(1-3): 191-203 (1989) - [j10]Dean G. Hoffman, Charles Curtis Lindner, Christopher A. Rodger:
On the construction of odd cycle systems. J. Graph Theory 13(4): 417-426 (1989) - [j9]Douglas A. Leonard, C. A. Rodger:
Limiting error propagation in Viterbi decoding of convolutional codes. IEEE Trans. Inf. Theory 35(6): 1295-1299 (1989) - 1988
- [j8]Charles C. Lindner, Christopher A. Rodger:
Nesting and Almost Resolvability of Pentagon Systems. Eur. J. Comb. 9(5): 483-493 (1988) - [j7]Dean G. Hoffman, Christopher A. Rodger:
Class one graphs. J. Comb. Theory B 44(3): 372-376 (1988) - [j6]Katherine Heinrich, Charles Curtis Lindner, Christopher A. Rodger:
Almost resolvable decompositions of 2Kn into cycles of odd length. J. Comb. Theory A 49(2): 218-232 (1988) - 1987
- [j5]C. A. Rodger:
Embedding partial Mendelsohn triple systems. Discret. Math. 65(2): 187-196 (1987) - [j4]Christopher A. Rodger, S. J. Stubbs:
Embedding partial triple systems. J. Comb. Theory A 44(2): 241-252 (1987) - 1986
- [j3]Anthony J. W. Hilton, Christopher A. Rodger:
Hamiltonian decompositions of complete regular s-partite graphs. Discret. Math. 58(1): 63-78 (1986) - 1984
- [j2]C. A. Rodger:
Embedding an incomplete latin square in a latin square with a prescribed diagonal. Discret. Math. 51(1): 73-89 (1984) - [j1]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 A 37(3): 363-369 (1984) - [c1]Douglas A. Leonard, C. A. Rodger:
Explicit Kerdock codes over GF(2). AAECC 1984: 130-135
Coauthor Index
Hung-Lin Fu
aka: H. L. Fu
aka: H. L. Fu
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 01:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: