Jozef Sirán

  • Open University, Milton Keynes, UK

According to our database1, Jozef Sirán authored at least 119 papers between 1980 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:



Using bi-coset graphs to construct small regular and biregular graphs.
Discret. Math., 2024

Generalized Cayley maps and their Petrie duals.
Ars Math. Contemp., 2024

Clique-partitioned graphs.
Discret. Appl. Math., 2022

Classifying edge-biregular maps of negative prime Euler characteristic.
Art Discret. Appl. Math., 2022

Graphs derived from perfect difference sets.
Australas. J Comb., 2021

Convolution of aggregation functions.
Int. J. Gen. Syst., 2020

On the upper embedding of symmetric configurations with block size 3.
Discret. Math., 2020

On the upper embedding of Steiner triple systems and Latin squares.
Ars Math. Contemp., 2020

On the defect of vertex-transitive graphs of given degree and diameter.
J. Comb. Theory B, 2019

Asymptotically approaching the Moore bound for diameter three by Cayley graphs.
J. Comb. Theory B, 2019

An algebraic approach to lifts of digraphs.
Discret. Appl. Math., 2019

Regular self-dual and self-Petrie-dual maps of arbitrary valency.
Ars Math. Contemp., 2019

Inverting non-invertible labeled trees.
Australas. J Comb., 2019

Continuous functions with given super-additive and sub-additive transformations.
Int. J. Gen. Syst., 2018

J. Interconnect. Networks, 2017

Revisiting Constructions of Large Cayley Graphs of Given Degree and Diameter from Regular Orbits.
J. Interconnect. Networks, 2017

Aggregation functions with given super-additive and sub-additive transformations.
Int. J. Gen. Syst., 2017

On the existence of aggregation functions with given super-additive and sub-additive transformations.
Fuzzy Sets Syst., 2017

Dan Archdeacon (11 May 1954 to 18 February 2015).
Ars Math. Contemp., 2017

Special issue in honour of Dan S. Archdeacon: Guest Editorial.
Australas. J Comb., 2017

GEMS 2013.
Ars Math. Contemp., 2016

Polarity graphs revisited.
Ars Math. Contemp., 2015

Smallest Vertex-Transitive Graphs of Given Degree and Diameter.
J. Graph Theory, 2014

Regular pinched maps.
Australas. J Comb., 2014

Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes.
Discret. Math., 2013

Nonorientable regular maps over linear fractional groups.
Ars Math. Contemp., 2013

How symmetric can maps on surfaces be?
Proceedings of the Surveys in Combinatorics 2013, 2013

Self-dual and self-petrie-dual regular maps.
J. Graph Theory, 2012

Graphs obtained from Moufang loops and regular maps.
J. Graph Theory, 2012

Approaching the Moore bound for diameter two by Cayley graphs.
J. Comb. Theory B, 2012

Classification of regular maps of Euler characteristic -3p.
J. Comb. Theory B, 2012

Random Cayley digraphs of diameter 2 and given degree.
Discret. Math. Theor. Comput. Sci., 2012

Hyperbolic analogues of fullerenes on orientable surfaces.
Discret. Math., 2012

Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups.
Discret. Math., 2012

Imprimitivity of locally finite, 1-ended, planar graphs.
Ars Math. Contemp., 2012

Covalence sequences of transitive plane tessellations and transitive maps on surfaces.
Australas. J Comb., 2012

Small vertex-transitive and Cayley graphs of girth six and given degree: an algebraic approach.
J. Graph Theory, 2011

Small vertex-transitive graphs of given degree and girth.
Ars Math. Contemp., 2011

Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter.
J. Graph Theory, 2010

Non-orientable Regular Maps of a Given Type over Linear Fractional Groups.
Graphs Comb., 2010

Reflexibility of regular Cayley maps for abelian groups.
J. Comb. Theory B, 2009

Recent progress in classification of regular maps on a given compact surface.
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

New record graphs in the degree-diameter problem.
Australas. J Comb., 2008

Characterization of graphs which admit vertex-transitive embeddings.
J. Graph Theory, 2007

Möbius regular maps.
J. Comb. Theory B, 2007

Triangular embeddings of complete graphs from graceful labellings of paths.
J. Comb. Theory B, 2007

Planar width of regular maps.
Electron. Notes Discret. Math., 2007

Triangulations of orientable surfaces by complete tripartite graphs.
Discret. Math., 2006

Small surface trades in triangular embeddings.
Discret. Math., 2006

Complete characterization of almost Moore digraphs of degree three.
J. Graph Theory, 2005

Cayley maps.
J. Comb. Theory B, 2005

Regular maps whose groups do not act faithfully on vertices, edges, or faces.
Eur. J. Comb., 2005

Maximum genus embeddings of Steiner triple systems.
Eur. J. Comb., 2005

A note on large Cayley graphs of diameter two and given degree.
Discret. Math., 2005

Routing balanced communications on hamilton decomposable networks.
Parallel Process. Lett., 2004

Planar triangulations which quadrangulate other surfaces.
Eur. J. Comb., 2004

Obstructions to directed embeddings of Eulerian digraphs in the plane.
Eur. J. Comb., 2004

Halin's theorem for cubic graphs on an annulus.
Discret. Math., 2004

On the minimal nonzero distance between triangular embeddings of a complete graph.
Discret. Math., 2003

A note on the number of graceful labellings of paths.
Discret. Math., 2003

Regular clique covers of graphs.
Australas. J Comb., 2003

Recursive constructions for triangulations.
J. Graph Theory, 2002

Sewing Ribbons on Graphs in Space.
J. Comb. Theory B, 2002

On Range Query Usability of Statistical Databases.
Int. J. Comput. Math., 2002

Skew-morphisms of regular Cayley maps.
Discret. Math., 2002

On the injective chromatic number of graphs.
Discret. Math., 2002

Counterexamples to the uniform shortest path routing conjecture for vertex-transitive graphs.
Discret. Appl. Math., 2002

2-Compromise Usability in 1-Dimensional Statistical Databases.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Realizing finite edge-transitive orientable maps.
J. Graph Theory, 2001

Trading crossings for handles and crosscaps.
J. Graph Theory, 2001

Triangle group representations and their applications to graphs and maps.
Discret. Math., 2001

Digraphs of degree two which miss the Moore bound by two.
Discret. Math., 2001

Exponential Families of Non-Isomorphic Triangulations of Complete Graphs.
J. Comb. Theory B, 2000

Almost Moore digraphs are diregular.
Discret. Math., 2000

Halving Complete 4-Partite Graphs.
Ars Comb., 2000

Bipartite labeling of trees with maximum degree three.
J. Graph Theory, 1999

Characterizing planarity using theta graphs.
J. Graph Theory, 1998

A Note on Large Graphs of Diameter Two and Given Maximum Degree<sup>, </sup>.
J. Comb. Theory B, 1998

Face 2-Colourable Triangular Embeddings of Complete Graphs.
J. Comb. Theory B, 1998

A Nebeský-Type Characterization for Relative Maximum Genus.
J. Comb. Theory B, 1998

A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments.
Electron. J. Comb., 1998

Large graphs with small degree and diameter: a voltage assignment approach.
Australas. J Comb., 1998

Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface.
J. Graph Theory, 1997

Edge-Ends in Countable Graphs.
J. Comb. Theory B, 1997

Maximal Orthogonal Latin Rectangles.
Ars Comb., 1997

The crossing number of <i>K</i><sub>3, <i>n</i></sub> in a surface.
J. Graph Theory, 1996

Covering genus-reducing edges by Kuratowski subgraphs.
J. Graph Theory, 1996

The Existence of Selfcomplementary Circulant Graphs.
Eur. J. Comb., 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

Bipartite labelings of trees and the gracesize.
J. Graph Theory, 1995

Local and global average degree in graphs and multigraphs.
J. Graph Theory, 1994

Anti-mitre steiner triple systems.
Graphs Comb., 1994

Sachs triangulations and regular maps.
Discret. Math., 1994

Regular maps from Cayley graphs II antibalanced Cayley maps.
Discret. Math., 1994

Circular embeddings of planar graphs in nonspherical surfaces.
Discret. Math., 1994

A construction of vertex-transitive non-Cayley graphs.
Australas. J Comb., 1994

Branched coverings of maps and lifts of map homomorphisms.
Australas. J Comb., 1994

Orientable and non-orientable maps with given automorphism groups.
Australas. J Comb., 1993

Nearly uniform distribution of edges among <i>k</i>-subgraphs of a graph.
J. Graph Theory, 1992

Kuratowski-type theorems do not extend to pseudosurfaces.
J. Comb. Theory B, 1992

Regular maps from Cayley graphs, part 1: Balanced Cayley maps.
Discret. Math., 1992

Groups with sign structure and their antiautomorphisms.
Discret. Math., 1992

Characterization of the maximum genus of a signed graph.
J. Comb. Theory B, 1991

End-faithful forests and spanning trees in infinite graphs.
Discret. Math., 1991

Duke's theorem does not extend to signed graph embeddings.
Discret. Math., 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

Solution of two problems of P. Erdös concerning Hamiltonian cycles.
Discret. Math., 1990

A construction of thickness-minimal graphs.
Discret. Math., 1987

On a construction of Thomassen.
Graphs Comb., 1986

Quotients of connected regular graphs of even degree.
J. Comb. Theory B, 1985

Infinite families of crossing-critical graphs with a given crossing number.
Discret. Math., 1984

Crossing-critical edges and Kuratowski subgraphs of a graph.
J. Comb. Theory B, 1983

Note on a new coloring number of a graph.
J. Graph Theory, 1980