default search action
Jozef Sirán
Person information
- affiliation: Open University, Milton Keynes, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j114]Robert Jajcay, Jozef Sirán, Yan Wang:
Generalized Cayley maps and their Petrie duals. Ars Math. Contemp. 24(3): 3 (2024) - [j113]Stefan Gyürki
, Robert Jajcay, Pavol János
Using bi-coset graphs to construct small regular and biregular graphs. Discret. Math. 347(5): 113946 (2024) - 2022
- [j112]Olivia Reade, Jozef Sirán:
Classifying edge-biregular maps of negative prime Euler characteristic. Art Discret. Appl. Math. 5(3) (2022) - [j111]Grahame Erskine
Clique-partitioned graphs. Discret. Appl. Math. 314: 238-248 (2022) - 2021
- [j110]Grahame Erskine, Peter Fratric, Jozef Sirán:
Graphs derived from perfect difference sets. Australas. J Comb. 80: 48-56 (2021) - 2020
- [j109]Terry S. Griggs, Thomas A. McCourt, Jozef Sirán:
On the upper embedding of Steiner triple systems and Latin squares. Ars Math. Contemp. 18(1): 127-135 (2020) - [j108]Grahame Erskine
On the upper embedding of symmetric configurations with block size 3. Discret. Math. 343(4): 111774 (2020) - [j107]Radko Mesiar, Adam Seliga
Convolution of aggregation functions. Int. J. Gen. Syst. 49(7): 747-759 (2020)
2010 – 2019
- 2019
- [j106]Sona Pavlíková, Jozef Sirán:
Inverting non-invertible labeled trees. Australas. J Comb. 75: 246-255 (2019) - [j105]Jay Fraser, Olivia Jeans, Jozef Sirán:
Regular self-dual and self-Petrie-dual maps of arbitrary valency. Ars Math. Contemp. 16(2): 403-410 (2019) - [j104]Cristina Dalfó
An algebraic approach to lifts of digraphs. Discret. Appl. Math. 269: 68-76 (2019) - [j103]Martin Bachratý
Asymptotically approaching the Moore bound for diameter three by Cayley graphs. J. Comb. Theory B 134: 203-217 (2019) - [j102]Geoffrey Exoo, Robert Jajcay, Martin Macaj, Jozef Sirán:
On the defect of vertex-transitive graphs of given degree and diameter. J. Comb. Theory B 134: 322-340 (2019) - 2018
- [j101]Alexandra Siposová, Jozef Sirán:
Continuous functions with given super-additive and sub-additive transformations. Int. J. Gen. Syst. 47(8): 842-848 (2018) - 2017
- [j100]C. Paul Bonnington, Jeffrey H. Dinitz, Jozef Sirán:
Special issue in honour of Dan S. Archdeacon: Guest Editorial. Australas. J Comb. 67: 65-76 (2017) - [j99]Drago Bokal, Bojan Mohar, Jozef Sirán:
Dan Archdeacon (11 May 1954 to 18 February 2015). Ars Math. Contemp. 12(1) (2017) - [j98]Alexandra Siposová, Ladislav Sipeky, Jozef Sirán:
On the existence of aggregation functions with given super-additive and sub-additive transformations. Fuzzy Sets Syst. 324: 117-126 (2017) - [j97]Fateme Kouchakinejad
Aggregation functions with given super-additive and sub-additive transformations. Int. J. Gen. Syst. 46(3): 225-234 (2017) - [j96]Oriol Serra, Jozef Sirán, Sanming Zhou:
Preface. J. Interconnect. Networks 17(3-4): 1702002:1-1702002:3 (2017) - [j95]Martin Bachratý
Revisiting Constructions of Large Cayley Graphs of Given Degree and Diameter from Regular Orbits. J. Interconnect. Networks 17(3-4): 1741011:1-1741011:8 (2017) - 2016
- [j94]Jozef Sirán, Martin Skoviera:
GEMS 2013. Ars Math. Contemp. 10(2) (2016) - 2015
- [j93]Martin Bachratý, Jozef Sirán:
Polarity graphs revisited. Ars Math. Contemp. 8(1): 55-67 (2015) - 2014
- [j92]Dan Archdeacon, C. Paul Bonnington, Jozef Sirán:
Regular pinched maps. Australas. J Comb. 58: 16-26 (2014) - [j91]Martin Knor, Jozef Sirán:
Smallest Vertex-Transitive Graphs of Given Degree and Diameter. J. Graph Theory 75(2): 137-149 (2014) - 2013
- [j90]Gareth A. Jones, Martin Macaj, Jozef Sirán:
Nonorientable regular maps over linear fractional groups. Ars Math. Contemp. 6(1): 25-35 (2013) - [j89]Camino Balbuena, Mirka Miller, Jozef Sirán, Mária Zdímalová:
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes. Discret. Math. 313(19): 2014-2019 (2013) - [p1]Jozef Sirán:
How symmetric can maps on surfaces be? Surveys in Combinatorics 2013: 161-238 - 2012
- [j88]Jana Siagiová, Jozef Sirán:
Covalence sequences of transitive plane tessellations and transitive maps on surfaces. Australas. J Comb. 53: 171-178 (2012) - [j87]Jozef Sirán, Mark E. Watkins:
Imprimitivity of locally finite, 1-ended, planar graphs. Ars Math. Contemp. 5(2): 217-221 (2012) - [j86]Heather Macbeth
Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups. Discret. Math. 312(1): 94-99 (2012) - [j85]Mathieu Dutour Sikiric
Hyperbolic analogues of fullerenes on orientable surfaces. Discret. Math. 312(4): 729-736 (2012) - [j84]Manuel E. Lladser, Primoz Potocnik, Jozef Sirán, Mark C. Wilson:
Random Cayley digraphs of diameter 2 and given degree. Discret. Math. Theor. Comput. Sci. 14(2): 83-90 (2012) - [j83]Jana Siagiová, Jozef Sirán:
Approaching the Moore bound for diameter two by Cayley graphs. J. Comb. Theory B 102(2): 470-473 (2012) - [j82]Marston D. E. Conder
Classification of regular maps of Euler characteristic -3p. J. Comb. Theory B 102(4): 967-981 (2012) - [j81]R. Bruce Richter, Jozef Sirán, Yan Wang:
Self-dual and self-petrie-dual regular maps. J. Graph Theory 69(2): 152-159 (2012) - [j80]Terry S. Griggs, Jozef Sirán, R. Bruce Richter:
Graphs obtained from Moufang loops and regular maps. J. Graph Theory 70(4): 427-434 (2012) - 2011
- [j79]Robert Jajcay, Jozef Sirán:
Small vertex-transitive graphs of given degree and girth. Ars Math. Contemp. 4(2): 375-384 (2011) - [j78]Eyal Loz, Martin Macaj, Mirka Miller, Jana Siagiová, Jozef Sirán, Jana Tomanová:
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach. J. Graph Theory 68(4): 265-284 (2011) - 2010
- [j77]Jozef Sirán:
Non-orientable Regular Maps of a Given Type over Linear Fractional Groups. Graphs Comb. 26(4): 597-602 (2010) - [j76]Heather Macbeth
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter. J. Graph Theory 64(2): 87-98 (2010)
2000 – 2009
- 2009
- [j75]Marston D. E. Conder
Reflexibility of regular Cayley maps for abelian groups. J. Comb. Theory B 99(1): 254-260 (2009) - 2008
- [j74]Eyal Loz, Jozef Sirán:
New record graphs in the degree-diameter problem. Australas. J Comb. 41: 63-80 (2008) - [j73]Martin Macaj, Jozef Sirán, Mária Ipolyiová:
Injectivity radius of representations of triangle groups and planar width of regular hypermaps. Ars Math. Contemp. 1(2): 223-241 (2008) - [j72]Martin Knor, Jozef Sirán:
Regular hamiltonian embeddings of Kn, n and regular triangular embeddings of Kn, n, n. Discret. Math. 308(20): 4796-4800 (2008) - [j71]Jozef Sirán:
Recent progress in classification of regular maps on a given compact surface. Electron. Notes Discret. Math. 31: 19-22 (2008) - 2007
- [j70]Martin Macaj, Jozef Sirán, Mária Ipolyiová:
Planar width of regular maps. Electron. Notes Discret. Math. 28: 477-484 (2007) - [j69]Cai Heng Li
Möbius regular maps. J. Comb. Theory B 97(1): 57-73 (2007) - [j68]Luis A. Goddyn, R. Bruce Richter, Jozef Sirán:
Triangular embeddings of complete graphs from graceful labellings of paths. J. Comb. Theory B 97(6): 964-970 (2007) - [j67]Jozef Sirán, Thomas W. Tucker:
Characterization of graphs which admit vertex-transitive embeddings. J. Graph Theory 55(3): 233-248 (2007) - 2006
- [j66]Mike J. Grannell, Terry S. Griggs, Martin Knor, Jozef Sirán:
Triangulations of orientable surfaces by complete tripartite graphs. Discret. Math. 306(6): 600-606 (2006) - [j65]G. K. Bennett, Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán:
Small surface trades in triangular embeddings. Discret. Math. 306(21): 2637-2646 (2006) - 2005
- [j64]Jana Siagiová, Jozef Sirán:
A note on large Cayley graphs of diameter two and given degree. Discret. Math. 305(1-3): 379-382 (2005) - [j63]Mike J. Grannell, Terry S. Griggs, Jozef Sirán:
Maximum genus embeddings of Steiner triple systems. Eur. J. Comb. 26(3-4): 401-416 (2005) - [j62]Cai Heng Li
Regular maps whose groups do not act faithfully on vertices, edges, or faces. Eur. J. Comb. 26(3-4): 521-541 (2005) - [j61]R. Bruce Richter, Jozef Sirán, Robert Jajcay, Thomas W. Tucker, Mark E. Watkins:
Cayley maps. J. Comb. Theory B 95(2): 189-245 (2005) - [j60]Edy Tri Baskoro
Complete characterization of almost Moore digraphs of degree three. J. Graph Theory 48(2): 112-126 (2005) - 2004
- [j59]Dan Archdeacon, C. Paul Bonnington
Halin's theorem for cubic graphs on an annulus. Discret. Math. 281(1-3): 13-25 (2004) - [j58]Atsuhiro Nakamoto
Planar triangulations which quadrangulate other surfaces. Eur. J. Comb. 25(6): 817-833 (2004) - [j57]C. Paul Bonnington
Obstructions to directed embeddings of Eulerian digraphs in the plane. Eur. J. Comb. 25(6): 877-891 (2004) - [j56]Ladislav Stacho, Jozef Sirán, Sanming Zhou
Routing balanced communications on hamilton decomposable networks. Parallel Process. Lett. 14(3-4): 377-385 (2004) - 2003
- [j55]Dan Archdeacon, Dalibor Froncek, Robert Jajcay, Zdenek Ryjácek, Jozef Sirán:
Regular clique covers of graphs. Australas. J Comb. 27: 307- (2003) - [j54]Robert E. L. Aldred, Jozef Sirán, Martin Sirán:
A note on the number of graceful labellings of paths. Discret. Math. 261(1-3): 27-30 (2003) - [j53]Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán:
On the minimal nonzero distance between triangular embeddings of a complete graph. Discret. Math. 269(1-3): 149-160 (2003) - 2002
- [j52]Sangho Shim, Jozef Sirán, Janez Zerovnik
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs. Discret. Appl. Math. 119(3): 281-286 (2002) - [j51]Robert Jajcay, Jozef Sirán:
Skew-morphisms of regular Cayley maps. Discret. Math. 244(1-3): 167-179 (2002) - [j50]Gena Hahn, Jan Kratochvíl
On the injective chromatic number of graphs. Discret. Math. 256(1-2): 179-192 (2002) - [j49]Ljiljana Brankovic
On Range Query Usability of Statistical Databases. Int. J. Comput. Math. 79(12): 1265-1271 (2002) - [j48]Dan Archdeacon, C. Paul Bonnington
Sewing Ribbons on Graphs in Space. J. Comb. Theory B 86(1): 1-26 (2002) - [j47]Mike J. Grannell, Terry S. Griggs, Jozef Sirán:
Recursive constructions for triangulations. J. Graph Theory 39(2): 87-107 (2002) - [c4]Ljiljana Brankovic
2-Compromise Usability in 1-Dimensional Statistical Databases. COCOON 2002: 448-455 - 2001
- [j46]Mirka Miller, Jozef Sirán:
Digraphs of degree two which miss the Moore bound by two. Discret. Math. 226(1-3): 269-280 (2001) - [j45]Jozef Sirán:
Triangle group representations and their applications to graphs and maps. Discret. Math. 229(1-3): 341-358 (2001) - [j44]Jozef Sirán, Thomas W. Tucker, Mark E. Watkins:
Realizing finite edge-transitive orientable maps. J. Graph Theory 37(1): 1-34 (2001) - [j43]Dan Archdeacon, C. Paul Bonnington
Trading crossings for handles and crosscaps. J. Graph Theory 38(4): 230-243 (2001) - 2000
- [j42]Dalibor Froncek, Jozef Sirán:
Halving Complete 4-Partite Graphs. Ars Comb. 55 (2000) - [j41]Mirka Miller, Joan Gimbert, Jozef Sirán, Slamin:
Almost Moore digraphs are diregular. Discret. Math. 218(1-3): 265-270 (2000) - [j40]C. Paul Bonnington
Exponential Families of Non-Isomorphic Triangulations of Complete Graphs. J. Comb. Theory B 78(2): 169-184 (2000)
1990 – 1999
- 1999
- [j39]C. Paul Bonnington, Jozef Sirán:
Bipartite labeling of trees with maximum degree three. J. Graph Theory 31(1): 7-15 (1999) - 1998
- [j38]Ljiljana Brankovic, Mirka Miller, Ján Plesník, Joe Ryan, Jozef Sirán:
Large graphs with small degree and diameter: a voltage assignment approach. Australas. J Comb. 18: 65-76 (1998) - [j37]Ljiljana Brankovic
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments. Electron. J. Comb. 5 (1998) - [j36]Dan Archdeacon, C. Paul Bonnington
A Nebeský-Type Characterization for Relative Maximum Genus. J. Comb. Theory B 73(1): 77-98 (1998) - [j35]Mike J. Grannell, Terry S. Griggs, Jozef Sirán:
Face 2-Colourable Triangular Embeddings of Complete Graphs. J. Comb. Theory B 74(1): 8-19 (1998) - [j34]Brendan D. McKay, Mirka Miller, Jozef Sirán:
A Note on Large Graphs of Diameter Two and Given Maximum Degree, . J. Comb. Theory B 74(1): 110-118 (1998) - [j33]Dan Archdeacon, Jozef Sirán:
Characterizing planarity using theta graphs. J. Graph Theory 27(1): 17-20 (1998) - 1997
- [j32]Peter Horák, Alexander Rosa, Jozef Sirán:
Maximal Orthogonal Latin Rectangles. Ars Comb. 47 (1997) - [j31]Gena Hahn, François Laviolette, Jozef Sirán:
Edge-Ends in Countable Graphs. J. Comb. Theory B 70(2): 225-244 (1997) - [j30]Martin Knor, Jozef Sirán:
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface. J. Graph Theory 24(1): 1-8 (1997) - 1996
- [j29]Robert Jajcay, Jozef Sirán:
More constructions of vertex-transitive non-Cayley graphs based on counting closed walks. Australas. J Comb. 14: 121-132 (1996) - [j28]Norbert Sauer, Jozef Sirán:
The chromatic number of the union of two forests. Ars Comb. 42 (1996) - [j27]Dalibor Froncek
The Existence of Selfcomplementary Circulant Graphs. Eur. J. Comb. 17(7): 625-628 (1996) - [j26]R. Bruce Richter, Jozef Sirán:
The crossing number of K3, n in a surface. J. Graph Theory 21(1): 51-54 (1996) - [j25]Richard Brunet, R. Bruce Richter, Jozef Sirán:
Covering genus-reducing edges by Kuratowski subgraphs. J. Graph Theory 22(1): 39-45 (1996) - [c3]Ljiljana Brankovic, Mirka Miller, Jozef Sirán:
Towards a Practical Auditing Method for the Prevention of Statistical Database Compromise. Australasian Database Conference 1996: 177-184 - [c2]Dan Archdeacon, C. Paul Bonnington, John Pearson, Jozef Sirán:
The Hadwiger Number for the Product of Two Cycles. DMTCS 1996: 113-120 - 1995
- [j24]Alexander Rosa, Jozef Sirán:
Bipartite labelings of trees and the gracesize. J. Graph Theory 19(2): 201-215 (1995) - 1994
- [j23]Dan Archdeacon, R. Bruce Richter, Jozef Sirán, Martin Skoviera:
Branched coverings of maps and lifts of map homomorphisms. Australas. J Comb. 9: 109-122 (1994) - [j22]Robert Jajcay, Jozef Sirán:
A construction of vertex-transitive non-Cayley graphs. Australas. J Comb. 10: 105-114 (1994) - [j21]Jozef Sirán, Martin Skoviera:
Regular maps from Cayley graphs II antibalanced Cayley maps. Discret. Math. 124(1-3): 179-191 (1994) - [j20]R. Bruce Richter, Paul D. Seymour
Circular embeddings of planar graphs in nonspherical surfaces. Discret. Math. 126(1-3): 273-280 (1994) - [j19]Jozef Sirán, Martin Skoviera, Heinz-Jürgen Voss:
Sachs triangulations and regular maps. Discret. Math. 134(1-3): 161-175 (1994) - [j18]Charles J. Colbourn, Eric Mendelsohn, Alexander Rosa, Jozef Sirán:
Anti-mitre steiner triple systems. Graphs Comb. 10(2-4): 215-224 (1994) - [j17]Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza:
Local and global average degree in graphs and multigraphs. J. Graph Theory 18(7): 647-661 (1994) - 1993
- [j16]Jozef Sirán, Martin Skoviera:
Orientable and non-orientable maps with given automorphism groups. Australas. J Comb. 7: 47-54 (1993) - 1992
- [j15]Jozef Sirán, Martin Skoviera:
Groups with sign structure and their antiautomorphisms. Discret. Math. 108(1-3): 189-202 (1992) - [j14]Martin Skoviera, Jozef Sirán:
Regular maps from Cayley graphs, part 1: Balanced Cayley maps. Discret. Math. 109(1-3): 265-276 (1992) - [j13]Jozef Sirán, Pavol Gvozdjak:
Kuratowski-type theorems do not extend to pseudosurfaces. J. Comb. Theory B 54(2): 209-212 (1992) - [j12]Jozef Sirán, Zsolt Tuza:
Nearly uniform distribution of edges among k-subgraphs of a graph. J. Graph Theory 16(6): 591-604 (1992) - 1991
- [j11]Jozef Sirán:
Characterization of signed graphs which are cellularly embeddable in no more than one surface. Discret. Math. 94(1): 39-44 (1991) - [j10]Jozef Sirán:
Duke's theorem does not extend to signed graph embeddings. Discret. Math. 94(3): 233-238 (1991) - [j9]Jozef Sirán:
End-faithful forests and spanning trees in infinite graphs. Discret. Math. 95(1-3): 331-340 (1991) - [j8]Jozef Sirán, Martin Skoviera:
Characterization of the maximum genus of a signed graph. J. Comb. Theory B 52(1): 124-146 (1991) - [c1]Pavol Gvozdjak, Jozef Sirán:
Regular maps from voltage assignments. Graph Structure Theory 1991: 441-454 - 1990
- [j7]Peter Horák, Jozef Sirán:
Solution of two problems of P. Erdös concerning Hamiltonian cycles. Discret. Math. 84(1): 23-29 (1990)
1980 – 1989
- 1987
- [j6]Jozef Sirán, Peter Horák:
A construction of thickness-minimal graphs. Discret. Math. 64(2-3): 263-268 (1987) - 1986
- [j5]Peter Horák, Jozef Sirán:
On a construction of Thomassen. Graphs Comb. 2(1): 347-350 (1986) - 1985
- [j4]Jozef Sirán, Martin Skoviera:
Quotients of connected regular graphs of even degree. J. Comb. Theory B 38(3): 214-225 (1985) - 1984
- [j3]Jozef Sirán:
Infinite families of crossing-critical graphs with a given crossing number. Discret. Math. 48(1): 129-132 (1984) - 1983
- [j2]Jozef Sirán:
Crossing-critical edges and Kuratowski subgraphs of a graph. J. Comb. Theory B 35(2): 83-92 (1983) - 1980
- [j1]Peter Horák, Jozef Sirán:
Note on a new coloring number of a graph. J. Graph Theory 4(1): 111-113 (1980)
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-10-07 22:05 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: