default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Pike
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j37]Andrea C. Burgess, Robert D. Luther, David A. Pike:
Existential closure in uniform hypergraphs. Discret. Math. 348(4): 114372 (2025)- 2024
- [j36]Andrea C. Burgess, Robert D. Luther
, David A. Pike:
Existential Closure in Line Graphs. Graphs Comb. 40(5): 101 (2024) - [j35]Andrea C. Burgess, Robert D. Luther, David A. Pike:
The edge-connectivity of vertex-transitive hypergraphs. J. Graph Theory 105(2): 252-259 (2024) - 2022
- [j34]Andrea C. Burgess, Nicholas J. Cavenagh, David A. Pike:
Mutually orthogonal cycle systems. Ars Math. Contemp. 23(2) (2022) - [i2]Andrea C. Burgess, John Marcoux, David A. Pike:
Firefighting with a Distance-Based Restriction. CoRR abs/2204.01908 (2022) - 2021
- [j33]Kathleen D. Barnetson, Andrea C. Burgess, Jessica A. Enright, Jared Howell, David A. Pike, Brady Ryan:
The firebreak problem. Networks 77(3): 372-382 (2021) - 2020
- [j32]Rosalind A. Cameron, David A. Pike:
Decomposable Twofold Triple Systems with Non-Hamiltonian 2-Block Intersection Graphs. Electron. J. Comb. 27(4): 4 (2020) - [j31]Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike:
Cops that surround a robber. Discret. Appl. Math. 285: 552-566 (2020)
2010 – 2019
- 2019
- [i1]Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike:
Cops that surround a robber. CoRR abs/1910.14200 (2019) - 2018
- [j30]Robert D. Luther, David A. Pike:
Cycle Extensions in PBD Block-Intersection Graphs. Ars Comb. 138: 261-274 (2018) - [j29]Aras Erzurumluoglu, Karen Meagher, David A. Pike:
Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs. Graphs Comb. 34(6): 1279-1294 (2018) - 2017
- [j28]Iren Darijani, David A. Pike, Jonathan Poulin:
The chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems. Australas. J Comb. 69: 145-158 (2017) - [j27]Aras Erzurumluoglu, David A. Pike:
Twofold triple systems without 2-intersecting Gray codes. Des. Codes Cryptogr. 83(3): 611-631 (2017) - 2016
- [j26]Shannon L. Fitzpatrick, Jared Howell, Margaret-Ellen Messinger, David A. Pike:
A deterministic version of the game of zombies and survivors on graphs. Discret. Appl. Math. 213: 1-12 (2016) - [j25]Jason T. LeGrow, David A. Pike, Jonathan Poulin:
Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs. Des. Codes Cryptogr. 80(3): 421-433 (2016) - 2014
- [j24]Darryn E. Bryant, Nevena Francetic, Przemyslaw Gordinowicz, David A. Pike, Pawel Pralat:
Brushing without capacity restrictions. Discret. Appl. Math. 170: 33-45 (2014) - [j23]Daniel Horsley, David A. Pike:
On balanced incomplete block designs with specified weak chromatic number. J. Comb. Theory A 123(1): 123-153 (2014) - 2013
- [j22]David A. Pike, Asiyeh Sanaei:
The modular product and existential closure II. Australas. J Comb. 57: 145-156 (2013) - 2012
- [j21]David A. Pike, Asiyeh Sanaei:
The modular product and existential closure. Australas. J Comb. 52: 173-184 (2012) - 2011
- [j20]Andrew T. Jesso, David A. Pike, Nabil Shalaby:
Hamilton cycles in restricted block-intersection graphs. Des. Codes Cryptogr. 61(3): 345-353 (2011) - [j19]Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discret. Math. 311(10-11): 827-834 (2011) - 2010
- [j18]Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. 17(1) (2010) - [j17]Daniel Horsley, David A. Pike:
On cycle systems with specified weak chromatic number. J. Comb. Theory A 117(8): 1195-1206 (2010)
2000 – 2009
- 2009
- [j16]Öznur Yasar, Danny Dyer, David A. Pike, Margo Kondratieva:
Edge searching weighted graphs. Discret. Appl. Math. 157(8): 1913-1923 (2009) - [j15]David A. Pike, Robert C. Vandell, Matthew Walsh:
Hamiltonicity and restricted block-intersection graphs of t-designs. Discret. Math. 309(21): 6312-6315 (2009) - 2008
- [j14]Graham A. Case, David A. Pike:
Pancyclic PBD block-intersection graphs. Discret. Math. 308(5-6): 896-900 (2008) - [j13]Andrea C. Burgess, David A. Pike:
Colouring even cycle systems. Discret. Math. 308(5-6): 962-973 (2008) - 2007
- [j12]Alasdair Graham, David A. Pike, Nabil Shalaby:
Skolem labelled trees and Ps□Pt Cartesian products. Australas. J Comb. 38: 101-116 (2007) - [j11]Neil A. McKay, David A. Pike:
Existentially Closed BIBD Block-Intersection Graphs. Electron. J. Comb. 14(1) (2007) - 2006
- [j10]Joanna A. Ellis-Monaghan, David A. Pike, Yubo Zou:
Decycling of Fibonacci cubes. Australas. J Comb. 35: 31-40 (2006) - 2005
- [j9]David A. Pike, Yubo Zou:
Decycling Cartesian Products of Two Cycles. SIAM J. Discret. Math. 19(3): 651-663 (2005) - 2004
- [j8]Aygul Mamut, David A. Pike, Michael Edwin Raines:
Pancyclic BIBD block-intersection graphs. Discret. Math. 284(1-3): 205-208 (2004) - 2003
- [j7]David A. Pike:
Decycling Hypercubes. Graphs Comb. 19(4): 547-550 (2003) - 2001
- [j6]David A. Pike, Nabil Shalaby:
The Use of Sklem Sequences to Generate Perfect One-Factorizations. Ars Comb. 59 (2001)
1990 – 1999
- 1999
- [j5]David A. Pike:
Hamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems. Ars Comb. 51 (1999) - 1998
- [j4]Elizabeth J. Billington, David A. Pike:
Decomposing block-intersection graphs of Steiner triple systems into triangles. Australas. J Comb. 18: 51-64 (1998) - [j3]Italo J. Dejter, David A. Pike, Christopher A. Rodger:
The directed almost resolvable Hamilton-Waterloo problem. Australas. J Comb. 18: 201-208 (1998) - 1995
- [j2]David A. Pike:
Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree. Australas. J Comb. 12: 291-294 (1995) - [j1]David A. Pike:
Hamilton decompositions of some line graphs. J. Graph Theory 20(4): 473-479 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-06 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
