Mariusz Meszka

According to our database1, Mariusz Meszka authored at least 39 papers between 1996 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Orthogonal one-factorizations of complete multipartite graphs.
Des. Codes Cryptogr., 2019

Cyclic and rotational six-cycle systems.
Bull. ICA, 2019

2018
New sufficient conditions for bipancyclicity of balanced bipartite digraphs.
Discret. Math., 2018

Reaction graphs of double Fano planes.
Art Discret. Appl. Math., 2018

2017
Maximal Edge-Colorings of Graphs.
Graphs Comb., 2017

A possible analogue of ρ-labellings for 3-uniform hypergraphs.
Electron. Notes Discret. Math., 2017

Kite systems of order 8; embedding of kite systems into bowtie systems.
Australas. J Comb., 2017

Revisiting the intersection problem for minimum coverings of complete graphs with triples.
Australas. J Comb., 2017

2016
Decompositions of complete graphs into circulants.
Discret. Math., 2016

2015
Almost 2-perfect 6-cycle systems.
Des. Codes Cryptogr., 2015

Cubic leaves.
Australas. J Comb., 2015

2014
Minimum Number of Palettes in Edge Colorings.
Graphs Comb., 2014

2013
Triple metamorphosis of twofold triple systems.
Discret. Math., 2013

Palettes in block colourings of designs.
Australas. J Comb., 2013

2012
Decompositions of a complete multidigraph into almost arbitrary paths.
Discuss. Math. Graph Theory, 2012

Factorizations of complete graphs into brooms.
Discret. Math., 2012

2011
Almost resolvable minimum coverings of complete graphs with 4-cycles.
Australas. J Comb., 2011

2009
Decompositions of nearly complete digraphs into t isomorphic parts.
Discuss. Math. Graph Theory, 2009

Steiner almost self-complementary graphs and halving near-Steiner triple systems.
Discret. Math., 2009

k-Cycle Free One-Factorizations of Complete Graphs.
Electron. J. Comb., 2009

On (K<sub>4</sub>, K<sub>4</sub>-e)-Designs.
Ars Comb., 2009

Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles.
Australas. J Comb., 2009

2008
Solution to the problem of Kubesa.
Discuss. Math. Graph Theory, 2008

The chromatic number of 5-valent circulants.
Discret. Math., 2008

2007
Research Problems from the Fourth Cracow Conference (Czorsztyn, 2002).
Discret. Math., 2007

Preface.
Discret. Math., 2007

A note on decompositions of transitive tournaments.
Discret. Math., 2007

A note on decompositions of transitive tournaments II.
Australas. J Comb., 2007

2006
Decompositions of a complete multidigraph into nonhamiltonian paths.
J. Graph Theory, 2006

Preface.
Electron. Notes Discret. Math., 2006

2004
Edge Decompositions of Multigraphs into 3-Matchings.
Graphs Comb., 2004

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

2002
Decompositions of multigraphs into parts with two edges.
Discuss. Math. Graph Theory, 2002

2001
Preface.
Discret. Math., 2001

2000
On some third parts of nearly complete digraphs.
Discret. Math., 2000

On the Strong Chromatic Index of Cyclic Multigraphs.
Discret. Appl. Math., 2000

1999
Decomposition of Multigraphs into Isomorphic Graphs with Two Edges.
Ars Comb., 1999

1998
Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs.
Comb., 1998

1996
Hymn teorii grafów.
Discuss. Math. Graph Theory, 1996


  Loading...