Jozef Sirán
Affiliations:- Open University, Milton Keynes, UK
According to our database1,
Jozef Sirán
authored at least 121 papers
between 1980 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on math.sk
On csauthors.net:
Bibliography
2024
Discret. Math., 2024
Art Discret. Appl. Math., 2024
A computer-free classification of orientably-regular maps on surfaces of genus p+1 for prime p.
Art Discret. Appl. Math., 2024
2022
Art Discret. Appl. Math., 2022
2021
2020
Discret. Math., 2020
Ars Math. Contemp., 2020
2019
J. Comb. Theory B, 2019
J. Comb. Theory B, 2019
Ars Math. Contemp., 2019
2018
Int. J. Gen. Syst., 2018
2017
Revisiting Constructions of Large Cayley Graphs of Given Degree and Diameter from Regular Orbits.
J. Interconnect. Networks, 2017
Int. J. Gen. Syst., 2017
On the existence of aggregation functions with given super-additive and sub-additive transformations.
Fuzzy Sets Syst., 2017
Australas. J Comb., 2017
2016
2015
2014
J. Graph Theory, 2014
2013
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes.
Discret. Math., 2013
Proceedings of the Surveys in Combinatorics 2013, 2013
2012
J. Comb. Theory B, 2012
Discret. Math. Theor. Comput. Sci., 2012
Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups.
Discret. Math., 2012
Covalence sequences of transitive plane tessellations and transitive maps on surfaces.
Australas. J Comb., 2012
2011
Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach.
J. Graph Theory, 2011
2010
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter.
J. Graph Theory, 2010
Graphs Comb., 2010
2009
2008
Electron. Notes Discret. Math., 2008
Regular hamiltonian embeddings of K<sub>n, n</sub> and regular triangular embeddings of K<sub>n, n, n</sub>.
Discret. Math., 2008
Injectivity radius of representations of triangle groups and planar width of regular hypermaps.
Ars Math. Contemp., 2008
2007
J. Graph Theory, 2007
J. Comb. Theory B, 2007
2006
Discret. Math., 2006
2005
J. Graph Theory, 2005
Eur. J. Comb., 2005
2004
Parallel Process. Lett., 2004
Eur. J. Comb., 2004
2003
Discret. Math., 2003
2002
Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
Discret. Appl. Math., 2002
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002
2001
Discret. Math., 2001
2000
J. Comb. Theory B, 2000
Halving Complete 4-Partite Graphs.
Ars Comb., 2000
1999
1998
J. Comb. Theory B, 1998
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments.
Electron. J. Comb., 1998
Australas. J Comb., 1998
1997
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface.
J. Graph Theory, 1997
Maximal Orthogonal Latin Rectangles.
Ars Comb., 1997
1996
J. Graph Theory, 1996
The chromatic number of the union of two forests.
Ars Comb., 1996
More constructions of vertex-transitive non-Cayley graphs based on counting closed walks.
Australas. J Comb., 1996
The Hadwiger Number for the Product of Two Cycles.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
Towards a Practical Auditing Method for the Prevention of Statistical Database Compromise.
Proceedings of the Proceeding Seventh Australasian Database Conference, 1996
1995
1994
1993
Australas. J Comb., 1993
1992
J. Graph Theory, 1992
1991
Characterization of signed graphs which are cellularly embeddable in no more than one surface.
Discret. Math., 1991
Regular maps from voltage assignments.
Proceedings of the Graph Structure Theory, 1991
1990
Discret. Math., 1990
1987
1986
1985
1984
Discret. Math., 1984
1983
1980