Stefan Gyürki

Orcid: 0000-0001-9633-1338

According to our database1, Stefan Gyürki authored at least 9 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2022
On the automorphisms of a family of small q-regular graphs of girth 8.
Art Discret. Appl. Math., October, 2022

Goal-minimally k-diametric Graphs with not so Small Diameters.
Proceedings of the 22nd Conference Information Technologies, 2022

2017
Some new non-Schurian association schemes on 2p<sup>2</sup> points, p an odd prime, and related combinatorial structures.
Australas. J Comb., 2017

2016
Infinite families of directed strongly regular graphs using equitable partitions.
Discret. Math., 2016

2014
Sporadic Examples of Directed Strongly Regular Graphs Obtained By Computer Algebra Experimentation.
Proceedings of the Computer Algebra in Scientific Computing - 16th International Workshop, 2014

2013
An efficient algorithm for testing goal-minimality of graphs.
Discret. Appl. Math., 2013

2012
Constructing goal-minimally k-diametric graphs by lifts.
Discret. Math., 2012

On the difference of the domination number of a digraph and of its reverse.
Discret. Appl. Math., 2012


  Loading...