Peter Danziger

According to our database1, Peter Danziger authored at least 31 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Constructing uniform 2-factorizations via row-sum matrices: Solutions to the Hamilton-Waterloo problem.
J. Comb. Theory, Ser. A, January, 2024

2022
On the Oberwolfach problem for single-flip 2-factors via graceful labelings.
J. Comb. Theory, Ser. A, 2022

Tic-Tac-Toe on an affine plane of order 4.
Australas. J Comb., 2022

2021
Cycle Decompositions of Complete Digraphs.
Electron. J. Comb., 2021

2020
Cops that surround a robber.
Discret. Appl. Math., 2020

2019
The Hamilton-Waterloo Problem with even cycle lengths.
Discret. Math., 2019

On the generalized Oberwolfach problem.
Ars Math. Contemp., 2019

2018
Orthogonally Resolvable Matching Designs.
Discret. Math., 2018

On the Hamilton-Waterloo Problem with cycle lengths of distinct parities.
Discret. Math., 2018

2017
On the existence of unparalleled even cycle systems.
Eur. J. Comb., 2017

Zero-sum flows for triple systems.
Discret. Math., 2017

2016
A Cyclic Solution for an Infinite Class of Hamilton-Waterloo Problems.
Graphs Comb., 2016

On generalized Howell designs with block size three.
Des. Codes Cryptogr., 2016

Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs.
Electron. J. Comb., 2016

2015
Bipartite 2-Factorizations of Complete Multipartite Graphs.
J. Graph Theory, 2015

2014
Resolvability of infinite designs.
J. Comb. Theory, Ser. A, 2014

2012
Cover starters for covering arrays of strength two.
Discret. Math., 2012

2011
On bipartite 2-factorizations of <i>k</i><sub><i>n</i></sub> - <i>I</i> and the Oberwolfach problem.
J. Graph Theory, 2011

Monogamous latin squares.
J. Comb. Theory, Ser. A, 2011

2009
Covering arrays avoiding forbidden edges.
Theor. Comput. Sci., 2009

Maximum uniformly resolvable designs with block sizes 2 and 4.
Discret. Math., 2009

Minimum embedding of a P<sub>4</sub>-design into a balanced incomplete block design of index lambda.
Discret. Math., 2009

Resolvable decompositions of λK<sub>n</sub> into the union of two 2-paths.
Ars Comb., 2009

2008
Resolvable modified group divisible designs with higher index.
Australas. J Comb., 2008

2006
On the Intersection Problem for Steiner Triple Systems of Different Orders.
Graphs Comb., 2006

2004
On the chromatic index of path decompositions.
Discret. Math., 2004

Class-Uniformly Resolvable Group Divisible Structures II: Frames.
Electron. J. Comb., 2004

Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs.
Electron. J. Comb., 2004

2003
Bicolour graphs of Steiner triple systems.
Discret. Math., 2003

1998
On the 2-parallel chromatic index of Steiner triple systems.
Australas. J Comb., 1998

1997
Uniform Restricted Resolvable Designs with r = 3.
Ars Comb., 1997


  Loading...