default search action
Alexander Rosa
Person information
- affiliation: McMaster University
- award (2012): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j87]Alexander Rosa:
Anton Kotzig, the founder of graph theory in Slovakia. Bull. ICA 93: 16-44 (2021)
2010 – 2019
- 2019
- [j86]Alexander Rosa:
Greedy triple systems. Bull. ICA 85: 74-78 (2019) - [j85]Mariusz Meszka, Alexander Rosa:
Cyclic and rotational six-cycle systems. Bull. ICA 87: 41-46 (2019) - 2018
- [j84]Mariusz Meszka
, Alexander Rosa:
Reaction graphs of double Fano planes. Art Discret. Appl. Math. 1(2): #P2.04 (2018) - 2017
- [j83]Mariusz Meszka, Alexander Rosa, Beatrice Ruini:
Kite systems of order 8; embedding of kite systems into bowtie systems. Australas. J Comb. 67: 378-393 (2017) - [j82]Mariusz Meszka, Alexander Rosa:
A possible analogue of ρ-labellings for 3-uniform hypergraphs. Electron. Notes Discret. Math. 60: 33-37 (2017) - 2016
- [j81]Mariusz Meszka, Roman Nedela, Alexander Rosa, Martin Skoviera:
Decompositions of complete graphs into circulants. Discret. Math. 339(10): 2471-2480 (2016) - 2015
- [j80]Mariusz Meszka, Alexander Rosa:
Cubic leaves. Australas. J Comb. 61: 114-129 (2015) - [j79]Charles J. Colbourn, Maria De Lourdes Merlini Giuliani, Alexander Rosa, Izabella Stuhl:
Steiner loops satisfying Moufang's theorem. Australas. J Comb. 63: 170-181 (2015) - [j78]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Almost 2-perfect 6-cycle systems. Des. Codes Cryptogr. 77(2-3): 321-333 (2015) - [j77]Alexander Rosa:
On a problem of Mariusz Meszka. Discret. Math. 338(1): 139-143 (2015) - 2013
- [j76]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Palettes in block colourings of designs. Australas. J Comb. 56: 235-244 (2013) - [j75]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Triple metamorphosis of twofold triple systems. Discret. Math. 313(19): 1872-1883 (2013) - 2012
- [j74]Charles C. Lindner, Alexander Rosa:
Extra two-fold Steiner pentagon systems. Discret. Math. 312(1): 30-34 (2012)
2000 – 2009
- 2009
- [j73]Mariusz Meszka, Alexander Rosa:
Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles. Australas. J Comb. 45: 291-302 (2009) - [j72]Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
On (K4, K4-e)-Designs. Ars Comb. 93 (2009) - [j71]Peter Horák, Alexander Rosa:
On a Problem of Marco Buratti. Electron. J. Comb. 16(1) (2009) - [j70]Mariusz Meszka, Alexander Rosa, Irmina A. Ziolo:
Steiner almost self-complementary graphs and halving near-Steiner triple systems. Discret. Math. 309(18): 5650-5654 (2009) - 2008
- [j69]Mario Gionfriddo
Preface. Discret. Math. 308(2-3): 153 (2008) - [j68]Charles Curtis Lindner, Alexander Rosa:
Perfect dexagon triple systems. Discret. Math. 308(2-3): 214-219 (2008) - [j67]Mariusz Meszka, Roman Nedela, Alexander Rosa:
The chromatic number of 5-valent circulants. Discret. Math. 308(24): 6269-6284 (2008) - [j66]Mario Gionfriddo
Equitable Specialized Block-Colourings for Steiner Triple Systems. Graphs Comb. 24(4): 313-326 (2008) - 2005
- [j65]Elizabeth J. Billington, Charles C. Lindner, Alexander Rosa:
Lambda-fold complete graph decompositions into perfect four-triple configurations. Australas. J Comb. 32: 323-330 (2005) - [j64]Hadi Kharaghani, Alexander Rosa:
Preface. Discret. Math. 299(1-3): 1 (2005) - [j63]Peter Horák, Alexander Rosa:
Extended Petersen graphs. Discret. Math. 299(1-3): 129-140 (2005) - 2004
- [j62]Mariusz Meszka, Alexander Rosa:
Embedding Steiner triple systems into Steiner systems S(2, 4, v). Discret. Math. 274(1-3): 199-212 (2004) - [j61]Selda Küçükçifçi, Charles C. Lindner, Alexander Rosa:
The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambdaKn with 4-cycles. Discret. Math. 278(1-3): 175-193 (2004) - [j60]Mario Gionfriddo
Bicolouring Steiner systems S(2, 4, v). Discret. Math. 283(1-3): 249-253 (2004) - [j59]Peter Horák, Roman Nedela, Alexander Rosa:
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors. Discret. Math. 284(1-3): 181-188 (2004) - 2003
- [j58]Charles J. Colbourn, Gaetano Quattrocchi, Alexander Rosa:
Resolving P(v, 3, λ) designs into regular P3-configurations. Australas. J Comb. 27: 205-212 (2003) - [j57]Malcolm Greig, Alexander Rosa:
Maximal arcs in Steiner systems S(2, 4, v). Discret. Math. 267(1-3): 143-151 (2003) - [j56]Charles J. Colbourn, Alexander Rosa:
Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. Graphs Comb. 19(3): 335-345 (2003) - 2002
- [j55]Ljiljana Brankovic, Peter Horák, Mirka Miller, Alexander Rosa:
Premature partial latin squares. Ars Comb. 63 (2002) - [j54]Frantisek Franek, Mike J. Grannell, Terry S. Griggs, Alexander Rosa:
On Large Sets of v-1 L-Intersecting Steiner Triple Systems of Order v. Des. Codes Cryptogr. 26(1-3): 243-256 (2002) - [j53]Frantisek Franek, Terry S. Griggs, Charles C. Lindner, Alexander Rosa:
Completing the spectrum of 2-chromatic S(2, 4, v). Discret. Math. 247(1-3): 225-228 (2002) - 2001
- [j52]Frantisek Franek, Dalibor Froncek, Alexander Rosa:
Imbalance in tournament designs. Australas. J Comb. 23: 237-252 (2001) - [j51]Salvatore Milici
Colouring Steiner systems with specified block colour patterns. Discret. Math. 240(1-3): 145-160 (2001) - 2000
- [j50]Mike J. Grannell, Terry S. Griggs, Alexander Rosa:
Three-line chromatic indices of Steiner triple systems. Australas. J Comb. 21: 67-84 (2000) - [j49]Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa, Paul J. Schellenberg:
Symmetric Graph Designs. Graphs Comb. 16(1): 93-102 (2000)
1990 – 1999
- 1999
- [j48]Charles C. Lindner, Alexander Rosa:
Monogamous decompositions of complete bipartite graphs, symmetric H-squares, and self-orthogonal 1-factorizations. Australas. J Comb. 20: 251-256 (1999) - [j47]Charles J. Colbourn, Jeffrey H. Dinitz, Alexander Rosa:
Bicoloring Steiner Triple Systems. Electron. J. Comb. 6 (1999) - 1998
- [j46]Peter Danziger, Mike J. Grannell, Terry S. Griggs, Alexander Rosa:
On the 2-parallel chromatic index of Steiner triple systems. Australas. J Comb. 17: 109-132 (1998) - 1997
- [j45]Peter Horák, Alexander Rosa, Jozef Sirán:
Maximal Orthogonal Latin Rectangles. Ars Comb. 47 (1997) - [j44]Frantisek Franek, Alexander Rosa, Terry S. Griggs:
Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems. Des. Codes Cryptogr. 12(1): 59-67 (1997) - [j43]Hans-Dietrich O. F. Gronau, Ronald C. Mullin, Alexander Rosa:
Orthogonal Double Covers of Complete Graphs by Trees. Graphs Comb. 13(3): 251-262 (1997) - [j42]Italo J. Dejter, Frantisek Franek, Eric Mendelsohn, Alexander Rosa:
Triangles in 2-factorizations. J. Graph Theory 26(2): 83-94 (1997) - 1996
- [j41]Terry S. Griggs, Alexander Rosa:
An invariant for one-factorizations of the complete graph. Ars Comb. 42 (1996) - [j40]Dalibor Froncek
The Existence of Selfcomplementary Circulant Graphs. Eur. J. Comb. 17(7): 625-628 (1996) - 1995
- [j39]Charles J. Colbourn, Alexander Rosa:
Orthogonal resolutions of triple systems. Australas. J Comb. 12: 259-270 (1995) - [j38]Alexander Rosa, Jozef Sirán:
Bipartite labelings of trees and the gracesize. J. Graph Theory 19(2): 201-215 (1995) - 1994
- [j37]Rolf S. Rees, Alexander Rosa, Walter D. Wallis:
Maximal sets of triangle- factors. Australas. J Comb. 9: 67-108 (1994) - [j36]Alexander Rosa, Stefan Znám:
Packing pentagons into complete graphs: how clumsy can you get? Discret. Math. 128(1-3): 305-316 (1994) - [j35]Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán:
Anti-mitre steiner triple systems. Graphs Comb. 10(2-4): 215-224 (1994) - 1993
- [j34]Charles J. Colbourn, Alexander Rosa, Stefan Znám:
The Spectrum of Maximal Partial Steiner Triple Systems. Des. Codes Cryptogr. 3(3): 209-219 (1993) - [j33]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) - 1992
- [j32]Alexander Rosa:
On a class of completable partial edge-colourings. Discret. Appl. Math. 35(3): 293-299 (1992) - [j31]Pramod K. Das, Alexander Rosa:
Halving Steiner triple systems. Discret. Math. 109(1-3): 59-67 (1992) - 1991
- [j30]Charles J. Colbourn, Alexander Rosa:
Leaves, excesses and neighbourhoods in triple systems. Australas. J Comb. 4: 143-178 (1991) - [j29]Charles J. Colbourn, Kevin T. Phelps, Marialuisa J. de Resmini, Alexander Rosa:
Partitioning Steiner triple systems into complete arcs. Discret. Math. 89(2): 149-160 (1991) - [j28]Charles J. Colbourn, Rudolf Mathon, Alexander Rosa, Nabil Shalaby:
The fine structure of threefold triple systems: u = 1 or 3 (mod 6). Discret. Math. 92(1-3): 49-64 (1991) - [j27]Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa:
Preface. Discret. Math. 97(1-3): 1 (1991) - 1990
- [j26]Charles J. Colbourn, Alexander Rosa:
Repeated edges in 2-factorizations. J. Graph Theory 14(1): 5-24 (1990)
1980 – 1989
- 1989
- [j25]Katherine Heinrich, Peter Horák, Alexander Rosa:
On Alspach's conjecture. Discret. Math. 77(1-3): 97-121 (1989) - [j24]Rudolf Mathon, Alexander Rosa:
On the (15, 5, lambda)-family of BIBDs. Discret. Math. 77(1-3): 205-216 (1989) - [j23]Kevin T. Phelps, Alexander Rosa, Eric Mendelsohn:
Cyclic Steiner Triple Systems with Cyclic Subsystems. Eur. J. Comb. 10(4): 363-367 (1989) - [j22]Charles J. Colbourn, William R. Pulleyblank, Alexander Rosa:
Hybrid triple systems and cubic feedback sets. Graphs Comb. 5(1): 15-28 (1989) - 1988
- [j21]Charles J. Colbourn, Dieter Jungnickel, Alexander Rosa:
The strong chromatic number of partial triple systems. Discret. Appl. Math. 20(1): 31-38 (1988) - 1987
- [j20]Alexander Rosa:
Repeated blocks in indecomposable twofold triple systems. Discret. Math. 65(3): 261-276 (1987) - 1986
- [j19]Charles J. Colbourn, Alexander Rosa:
Quadratic leaves of maximal partial triple systems. Graphs Comb. 2(1): 317-337 (1986) - [j18]Alexander Rosa, Dean G. Hoffman:
The number of repeated blocks in twofold triple systems. J. Comb. Theory A 41(1): 61-88 (1986) - 1985
- [j17]Alan Hartman
Cyclic One-Factorization of the Complete Graph. Eur. J. Comb. 6(1): 45-48 (1985) - [j16]Rudolf Mathon, Alexander Rosa:
A New Strongly Regular Graph. J. Comb. Theory A 38(1): 84-86 (1985) - [j15]Eric Mendelsohn, Alexander Rosa:
One-factorizations of the complete graph - A survey. J. Graph Theory 9(1): 43-65 (1985) - 1983
- [j14]Charles J. Colbourn, Marlene J. Colbourn, Alexander Rosa:
Completing small partial triple systems. Discret. Math. 45(2-3): 165-179 (1983) - 1982
- [j13]Alexander Rosa, Walter D. Wallis:
Premature sets of 1-factors or how not to schedule round robin tournaments. Discret. Appl. Math. 4(4): 291-297 (1982) - 1981
- [j12]Kevin T. Phelps, Alexander Rosa:
Steiner triple systems with rotational automorphisms. Discret. Math. 33(1): 57-66 (1981) - 1980
- [j11]Kevin T. Phelps, Alexander Rosa:
2-Chromatic Steiner Quadruple Systems. Eur. J. Comb. 1(3): 253-258 (1980)
1970 – 1979
- 1979
- [j10]Charlotte Huang, Anton Kotzig, Alexander Rosa:
On a variation of the Oberwolfach problem. Discret. Math. 27(3): 261-277 (1979) - 1978
- [j9]Charles C. Lindner, Alexander Rosa:
Steiner quadruple systems - a survey. Discret. Math. 22(2): 147-181 (1978) - 1977
- [j8]Charles C. Lindner, Alexander Rosa:
A Partial Room Square Can be Embedded in a Room Square. J. Comb. Theory A 22(1): 97-102 (1977) - 1976
- [j7]Charles C. Lindner, Alexander Rosa:
Steiner Quadruple Systems All of Whose Derived Steiner Triple Systems Are Nonisomorphic. J. Comb. Theory A 21(1): 35-43 (1976) - 1975
- [j6]Alexander Rosa, Charlotte Huang:
Another class of balanced graph designs: balanced circuit designs. Discret. Math. 12(3): 269-293 (1975) - [j5]Charles C. Lindner, Alexander Rosa:
Finite embedding theorems for partial Steiner triple systems. Discret. Math. 13(1): 31-39 (1975) - [j4]Alexander Rosa:
A Theorem on the Maximum Number of Disjoint Steiner Triple Systems. J. Comb. Theory A 18(3): 305-312 (1975) - 1974
- [j3]Alexander Rosa:
On the Falsity of a Conjecture on Orthogonal Steiner Triple Systems. J. Comb. Theory A 16(1): 126-128 (1974) - 1972
- [j2]Alexander Rosa:
On reverse Steiner triple systems. Discret. Math. 2(1): 61-71 (1972) - [j1]Pavol Hell, Alexander Rosa:
Graph decompositions, handcuffed prisoners and balanced P-designs. Discret. Math. 2(3): 229-252 (1972)
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 20:30 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: