default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKatherine Heinrich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j31]Peter Horák, Katherine Heinrich:
Partitioning infinite trees. J. Graph Theory 34(2): 113-127 (2000)
1990 – 1999
- 1999
- [j30]Katherine Heinrich, Jianxing Yin:
On group divisible covering designs. Discret. Math. 202(1-3): 101-112 (1999) - [j29]Iliya Bluskov, Katherine Heinrich:
General Upper Bounds on the Minimum Size of Covering Designs. J. Comb. Theory A 86(2): 205-213 (1999) - [j28]Katherine Heinrich, Jiping Liu, Min-Li Yu:
P4-decompositions of regular graphs. J. Graph Theory 31(2): 135-143 (1999) - 1998
- [j27]Katherine Heinrich, Jiping Liu, Cun-Quan Zhang:
Triangle-Free Circuit Decompositions and Petersen Minor. J. Comb. Theory B 72(2): 197-207 (1998) - 1996
- [j26]Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura:
A solution of Dudeney's round table problem for p^eq^f + 1. Ars Comb. 43 (1996) - [j25]Katherine Heinrich, P. Horak, Walter D. Wallis, Qinglin Yu:
Perfect double covers with paths of length four. J. Graph Theory 21(2): 187-197 (1996) - 1995
- [j24]Katherine Heinrich, Peter Horák:
Isomorphic factorizations of trees. J. Graph Theory 19(2): 187-199 (1995) - 1992
- [j23]Katherine Heinrich, Kichul Kim, Viktor K. Prasanna:
Perfect Latin Squares. Discret. Appl. Math. 37/38: 281-286 (1992) - [j22]Charles J. Colbourn, Katherine Heinrich:
Conflict-Free Access to Parallel Memories. J. Parallel Distributed Comput. 14(2): 193-200 (1992) - 1991
- [j21]Katherine Heinrich, Lisheng Wu, Lie Zhu:
Incomplete self-orthogonal latin squares ISOLS(6m + 6, 2m) exist for all m. Discret. Math. 87(3): 281-290 (1991) - [j20]Katherine Heinrich, Midori Kobayashi, Gisaku Nakamura:
Dudeney's round table problem. Discret. Math. 92(1-3): 107-125 (1991) - [j19]Katherine Heinrich:
Simple direct constructions for hybrid triple designs. Discret. Math. 97(1-3): 223-227 (1991) - [j18]Brian Alspach, C. C. Chen, Katherine Heinrich:
Characterization of a class of triangle-free graphs with a certain adjacency property. J. Graph Theory 15(4): 375-388 (1991) - 1990
- [j17]Brian Alspach, Katherine Heinrich:
Matching designs. Australas. J Comb. 2: 39-56 (1990) - [j16]Katherine Heinrich, Pavol Hell, David G. Kirkpatrick, Guizhen Liu:
A simple existence criterion for (g<f)- factors. Discret. Math. 85(3): 313-317 (1990) - [j15]Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu:
Existence of Resolvable Path Designs. Eur. J. Comb. 11(3): 205-211 (1990) - [j14]Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu:
On Resolvable Mixed Path Designs. Eur. J. Comb. 11(4): 313-318 (1990) - [j13]Katherine Heinrich:
Coloring the edges of km × km. J. Graph Theory 14(5): 575-583 (1990)
1980 – 1989
- 1989
- [j12]Katherine Heinrich, Peter Horák, Alexander Rosa:
On Alspach's conjecture. Discret. Math. 77(1-3): 97-121 (1989) - [j11]James Burling, Katherine Heinrich:
Near 2-factorizations of 2Kn: Cycles of even length. Graphs Comb. 5(1): 213-221 (1989) - [j10]Katherine Heinrich:
Combinatorial Designs (W. D. Wallis). SIAM Rev. 31(4): 698-699 (1989) - 1988
- [j9]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) - [j8]Katherine Heinrich, Guizhen Liu:
A lower bound on the number of spanning trees with k end-vertices. J. Graph Theory 12(1): 95-100 (1988) - 1987
- [j7]Katherine Heinrich, Pavol Hell:
On the problem of bandsize. Graphs Comb. 3(1): 279-284 (1987) - [j6]Katherine Heinrich, Gillian M. Nonay:
Exact coverings of 2-paths by 4-cycles. J. Comb. Theory A 45(1): 50-61 (1987) - 1986
- [j5]Katherine Heinrich, Lie Zhu:
Existence of orthogonal latin squares with aligned subsquares. Discret. Math. 59(1-2): 69-78 (1986) - 1983
- [j4]Katherine Heinrich, Anthony J. W. Hilton:
Doubly diagonal orthogonal latin squares. Discret. Math. 46(2): 173-182 (1983) - [j3]Katherine Heinrich:
Partitioning oriented 2-paths. J. Graph Theory 7(3): 359-367 (1983) - 1980
- [j2]Katherine Heinrich:
Latin Squares with No Proper Subsquares. J. Comb. Theory A 29(3): 346-353 (1980)
1970 – 1979
- 1978
- [j1]Walter D. Wallis, Katherine Heinrich:
Graphs with symmetric automorphism group. J. Graph Theory 2(4): 329-336 (1978)
Coauthor Index
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-06-10 21:27 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:
