![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Anton Kotzig
Person information
- affiliation: Université de Montréal, Canada
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1996
- [j18]Jaromir Abrham, Anton Kotzig:
Graceful valuations of 2-regular graphs with two components. Discret. Math. 150(1-3): 3-15 (1996) - 1995
- [j17]Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi:
Modular Nim. Theor. Comput. Sci. 143(2): 319-333 (1995) - 1994
- [j16]Jaromir Abrham, Anton Kotzig:
All 2-regular graphs consisting of 4-cycles are graceful. Discret. Math. 135(1-3): 1-14 (1994)
1980 – 1989
- 1988
- [j15]Abraham Berman, Anton Kotzig:
Cross-cloning and antipodal graphs. Discret. Math. 69(2): 107-114 (1988) - 1984
- [j14]Jaromir Abrham, Anton Kotzig:
Inequalities for perfect systems of difference sets. Discret. Math. 52(2-3): 287-291 (1984) - [j13]Anton Kotzig, Philip J. Laufer:
The Minimum Number of Components in 4-Regular Perfect Systems of Difference Sets. J. Comb. Theory A 37(3): 370-373 (1984) - 1982
- [j12]Anton Kotzig, Jean M. Turgeon:
Quasigroups defining Eulerian paths in complete graphs. J. Comb. Theory B 32(1): 45-56 (1982) - 1981
- [j11]Jaromir Abrham, Anton Kotzig:
Skolem sequences and additive permutations. Discret. Math. 37(2-3): 143-146 (1981) - [j10]Anton Kotzig:
Decompositions of complete graphs into isomorphic cubes. J. Comb. Theory B 31(3): 292-296 (1981)
1970 – 1979
- 1979
- [j9]Charlotte Huang, Anton Kotzig, Alexander Rosa:
On a variation of the Oberwolfach problem. Discret. Math. 27(3): 261-277 (1979) - [j8]Anton Kotzig:
1-Factorizations of cartesian products of regular graphs. J. Graph Theory 3(1): 23-34 (1979) - 1977
- [j7]Anton Kotzig, Jean M. Turgeon:
Regular perfect systems of differences sets. Discret. Math. 20: 249-254 (1977) - [j6]Anton Kotzig:
Change graphs of edge-colorings of planar cubic graphs. J. Comb. Theory B 22(1): 26-30 (1977) - 1976
- [j5]Anton Kotzig, Jean M. Turgeon:
On certain constructions for latin squares with no latin subsquares of order two. Discret. Math. 16(3): 263-270 (1976) - 1975
- [j4]Anton Kotzig:
Transformations of edge-colourings of cubic graphs. Discret. Math. 11(3): 391-399 (1975) - [j3]Anton Kotzig:
On the maximal order of cyclicity of antisymmetric directed graphs. Discret. Math. 12(1): 17-25 (1975) - 1973
- [j2]Anton Kotzig:
Decompositions of complete graphs into regular bichromatic factors. Discret. Math. 4(1): 65-69 (1973) - 1972
- [j1]Anton Kotzig:
Decompositions of complete graphs into regular bichromatic factors. Discret. Math. 2(4): 383-387 (1972)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint