Mariusz Meszka

Jakub Przybylo

Discret. Math., April, 2024

The seating couples problem in the even case.

[BibT_eX]

[DOI]

Anita Pasotti

Marco Antonio Pellegrini

Discret. Math., 2024

2019

Orthogonal one-factorizations of complete multipartite graphs.

[BibT_eX]

[DOI]

Magdalena Tyniec

Des. Codes Cryptogr., 2019

Cyclic and rotational six-cycle systems.

[BibT_eX]

[DOI]

Bull. ICA, 2019

2018

New sufficient conditions for bipancyclicity of balanced bipartite digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

Reaction graphs of double Fano planes.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

2017

Maximal Edge-Colorings of Graphs.

[BibT_eX]

[DOI]

Magdalena Tyniec

Graphs Comb., 2017

A possible analogue of ρ-labellings for 3-uniform hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Kite systems of order 8; embedding of kite systems into bowtie systems.

[BibT_eX]

[DOI]

Beatrice Ruini

Australas. J Comb., 2017

Revisiting the intersection problem for minimum coverings of complete graphs with triples.

[BibT_eX]

[DOI]

Christopher A. Rodger

Australas. J Comb., 2017

2016

Decompositions of complete graphs into circulants.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Almost 2-perfect 6-cycle systems.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2015

Cubic leaves.

[BibT_eX]

[DOI]

Australas. J Comb., 2015

2014

Minimum Number of Palettes in Edge Colorings.

[BibT_eX]

[DOI]

Graphs Comb., 2014

2013

Triple metamorphosis of twofold triple systems.

[BibT_eX]

[DOI]

Discret. Math., 2013

Palettes in block colourings of designs.

[BibT_eX]

[DOI]

Australas. J Comb., 2013

2012

Decompositions of a complete multidigraph into almost arbitrary paths.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2012

Factorizations of complete graphs into brooms.

[BibT_eX]

[DOI]

Petr Kovár

Michael Kubesa

Discret. Math., 2012

2011

Almost resolvable minimum coverings of complete graphs with 4-cycles.

[BibT_eX]

[DOI]

Elizabeth J. Billington

Dean G. Hoffman

Australas. J Comb., 2011

2009

Decompositions of nearly complete digraphs into t isomorphic parts.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2009

Steiner almost self-complementary graphs and halving near-Steiner triple systems.

[BibT_eX]

[DOI]

Irmina A. Ziolo

Discret. Math., 2009

k-Cycle Free One-Factorizations of Complete Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

On (K4, K4-e)-Designs.

[BibT_eX]

Ars Comb., 2009

Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles.

[BibT_eX]

[DOI]

Australas. J Comb., 2009

2008

Solution to the problem of Kubesa.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2008

The chromatic number of 5-valent circulants.

[BibT_eX]

[DOI]

Roman Nedela

Discret. Math., 2008

2007

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

[BibT_eX]

[DOI]

Rafal Kalinowski

Discret. Math., 2007

Preface.

[BibT_eX]

[DOI]

Rafal Kalinowski

Discret. Math., 2007

A note on decompositions of transitive tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2007

A note on decompositions of transitive tournaments II.

[BibT_eX]

[DOI]

Australas. J Comb., 2007

2006

Decompositions of a complete multidigraph into nonhamiltonian paths.

[BibT_eX]

[DOI]

J. Graph Theory, 2006

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2004

Edge Decompositions of Multigraphs into 3-Matchings.

[BibT_eX]

[DOI]

Zbigniew Lonc

Graphs Comb., 2004

Embedding Steiner triple systems into Steiner systems S(2, 4, v).

[BibT_eX]

[DOI]

Discret. Math., 2004

2002

Decompositions of multigraphs into parts with two edges.

[BibT_eX]

[DOI]

Jaroslav Ivanco

Discuss. Math. Graph Theory, 2002

2001

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

On some third parts of nearly complete digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

On the Strong Chromatic Index of Cyclic Multigraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Decomposition of Multigraphs into Isomorphic Graphs with Two Edges.

[BibT_eX]

Jaroslav Ivanco

Ars Comb., 1999

1998

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

[BibT_eX]

[DOI]