Mario Gionfriddo

Orcid: 0000-0002-5360-409X

According to our database1, Mario Gionfriddo authored at least 49 papers between 1981 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Complex uniformly resolvable decompositions of K_v.
Ars Math. Contemp., 2021

2020
Hypercycle systems.
Australas. J Comb., 2020

2018
Uniformly resolvable $(C_4, K_{1, 3})$-designs of order v and.
Contributions Discret. Math., 2018

Parallelism in Steiner systems.
Art Discret. Appl. Math., 2018

Perfect blocking sets in P3-designs.
Art Discret. Appl. Math., 2018

2017
α-Resolvable λ-fold G-designs.
Contributions Discret. Math., 2017

The Spectrum of Balanced P^(3)(1, 5)-Designs.
Contributions Discret. Math., 2017

2016
Nesting House-designs.
Discret. Math., 2016

The spectrum of α-resolvable λ-fold (K_4 - e)-designs.
Ars Math. Contemp., 2016

Nonagon quadruple systems: existence, balance, embeddings.
Australas. J Comb., 2016

2015
On uniformly resolvable {K<sub>2</sub>, P<sub>k</sub>}-designs with with k=3, 4.
Contributions Discret. Math., 2015

Balanced House-systems and Nestings.
Ars Comb., 2015

2014
Uniformly resolvable ℋ-designs with ℋ={P<sub>3</sub>, <sub>4</sub>}.
Australas. J Comb., 2014

Feasible sets of small bicolorable STSs.
Australas. J Comb., 2014

2013
Octagon kite systems.
Electron. Notes Discret. Math., 2013

Minimum embedding of STSs into (<i>K</i><sub>3</sub>+<i>e</i>)(K3+e)-systems.
Discret. Math., 2013

On the existence of uniformly resolvable decompositions of <i>K</i><sub><i>v</i></sub> and <i>K</i><sub><i>v</i></sub>-<i>I</i>-I into paths and kites.
Discret. Math., 2013

Minimum embedding of a K<sub>3</sub>-design into a balanced incomplete block design of index λ ≥ 2.
Ars Comb., 2013

2012
Preface.
Discret. Math., 2012

Balanced and strongly balanced P<sub>k</sub>-designs.
Discret. Math., 2012

Perfect octagon quadrangle systems - II.
Discret. Math., 2012

2-Regular equicolourings for P<sub>4</sub>-designs.
Discret. Math., 2012

2011
Octagon Quadrangle Systems nesting 4-kite-designs having equi-indices.
Comput. Sci. J. Moldova, 2011

Perfect Octagon Quadrangle Systems with an upper C<sub>4</sub>-system and a large spectrum.
Comput. Sci. J. Moldova, 2011

2010
Equitable specialized block-colourings for 4-cycle systems - II.
Discret. Math., 2010

Equitable specialized block-colourings for 4-cycle systems - I.
Discret. Math., 2010

Perfect dodecagon quadrangle systems.
Discret. Math., 2010

Preface.
Discret. Math., 2010

Perfect octagon quadrangle systems.
Discret. Math., 2010

2008
Equitable Specialized Block-Colourings for Steiner Triple Systems.
Graphs Comb., 2008

Embedding balanced P<sub>3</sub>-designs into (balanced) P<sub>4</sub>-designs.
Discret. Math., 2008

Preface.
Discret. Math., 2008

2007
An edge colouring of multigraphs.
Comput. Sci. J. Moldova, 2007

2004
Colouring 4-cycle systems with equitably coloured blocks.
Discret. Math., 2004

Bicolouring Steiner systems <i>S</i>(2, 4, <i>v</i>).
Discret. Math., 2004

2002
On the upper chromatic index of a multigraph.
Comput. Sci. J. Moldova, 2002

2001
Lower and upper chromatic numbers for BSTSs(2<sup>h</sup> - 1).
Comput. Sci. J. Moldova, 2001

1999
On the edge-coloring property for Hanani triple systems.
Discret. Math., 1999

1997
The color cost of a caterpillar.
Discret. Math., 1997

1996
A result concerning two conjectures of Berge and Chvátal.
Discret. Math., 1996

Preface.
Discret. Math., 1996

1994
On conjectures of Berge and Chvátal.
Discret. Math., 1994

Blocking Sets in SQS(2u).
Comb. Probab. Comput., 1994

1993
2-Colourings in S(t, t + 1, v).
Discret. Math., 1993

1991
Transitive multipermutation graphs: Case 4 <= n <= m.
Discret. Math., 1991

2-colouring K<sub>4</sub>-e designs.
Australas. J Comb., 1991

1988
On the parameter v<sub>2</sub>(h)<=6h for L<sub>2</sub>-coloured graphs.
Discret. Math., 1988

1983
On the set J(v) for Steiner Quadruple systems of order v = 2<sup>n</sup> with n>=4.
Discret. Math., 1983

1981
Construction of Steiner quadruple systems having a prescribed number of blocks in common.
Discret. Math., 1981


  Loading...