David A. Pike

Orcid: 0000-0001-8952-3016

According to our database1, David A. Pike authored at least 36 papers between 1995 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The edge-connectivity of vertex-transitive hypergraphs.
J. Graph Theory, February, 2024

2022
Mutually orthogonal cycle systems.
Ars Math. Contemp., November, 2022

Firefighting with a Distance-Based Restriction.
CoRR, 2022

2021
The firebreak problem.
Networks, 2021

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

Decomposable Twofold Triple Systems with Non-Hamiltonian 2-Block Intersection Graphs.
Electron. J. Comb., 2020

2018
Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs.
Graphs Comb., 2018

Cycle Extensions in PBD Block-Intersection Graphs.
Ars Comb., 2018

2017
Twofold triple systems without 2-intersecting Gray codes.
Des. Codes Cryptogr., 2017

The chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems.
Australas. J Comb., 2017

2016
Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs.
Des. Codes Cryptogr., 2016

A deterministic version of the game of zombies and survivors on graphs.
Discret. Appl. Math., 2016

2014
On balanced incomplete block designs with specified weak chromatic number.
J. Comb. Theory, Ser. A, 2014

Brushing without capacity restrictions.
Discret. Appl. Math., 2014

2013
The modular product and existential closure II.
Australas. J Comb., 2013

2012
The modular product and existential closure.
Australas. J Comb., 2012

2011
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19.
Discret. Math., 2011

Hamilton cycles in restricted block-intersection graphs.
Des. Codes Cryptogr., 2011

2010
On cycle systems with specified weak chromatic number.
J. Comb. Theory, Ser. A, 2010

Properties of the Steiner Triple Systems of Order 19.
Electron. J. Comb., 2010

2009
Hamiltonicity and restricted block-intersection graphs of t-designs.
Discret. Math., 2009

Edge searching weighted graphs.
Discret. Appl. Math., 2009

2008
Pancyclic PBD block-intersection graphs.
Discret. Math., 2008

Colouring even cycle systems.
Discret. Math., 2008

2007
Existentially Closed BIBD Block-Intersection Graphs.
Electron. J. Comb., 2007

Skolem labelled trees and P<sub>s</sub>□P<sub>t</sub> Cartesian products.
Australas. J Comb., 2007

2006
Decycling of Fibonacci cubes.
Australas. J Comb., 2006

2005
Decycling Cartesian Products of Two Cycles.
SIAM J. Discret. Math., 2005

2004
Pancyclic BIBD block-intersection graphs.
Discret. Math., 2004

2003
Decycling Hypercubes.
Graphs Comb., 2003

2001
The Use of Sklem Sequences to Generate Perfect One-Factorizations.
Ars Comb., 2001

1999
Hamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems.
Ars Comb., 1999

1998
The directed almost resolvable Hamilton-Waterloo problem.
Australas. J Comb., 1998

Decomposing block-intersection graphs of Steiner triple systems into triangles.
Australas. J Comb., 1998

1995
Hamilton decompositions of some line graphs.
J. Graph Theory, 1995

Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree.
Australas. J Comb., 1995


  Loading...