default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCraig Timmons
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Vladislav Taranchuk
, Craig Timmons:
Achromatic colorings of polarity graphs. Finite Fields Their Appl. 99: 102497 (2024)- [i1]Kathryn Haymaker, Michael Tait, Craig Timmons:
Hypergraphs of girth 5 and 6 and coding theory. CoRR abs/2404.01839 (2024) - 2023
- [j29]Beka Ergemlidze, Abhishek Methuku, Michael Tait, Craig Timmons:
Minimizing the number of complete bipartite graphs in a Ks-saturated graph. Discuss. Math. Graph Theory 43(3): 793-807 (2023) - 2022
- [j28]Griffin Johnston, Michael Tait, Craig Timmons:
Upper and lower bounds on the size of $B_{k}[g]$ sets. Australas. J Comb. 83: 129-140 (2022) - [j27]Craig Timmons:
Regular saturated graphs and sum-free sets. Discret. Math. 345(1): 112659 (2022) - 2021
- [j26]Michael Tait, Craig Timmons:
Regular Turán numbers of complete bipartite graphs. Discret. Math. 344(10): 112531 (2021) - 2020
- [j25]Jürgen Kritschgau, Abhishek Methuku, Michael Tait, Craig Timmons:
Few H copies in F -saturated graphs. J. Graph Theory 94(3): 320-348 (2020)
2010 – 2019
- 2019
- [j24]Cory Palmer, Michael Tait, Craig Timmons, Zsolt Adam Wagner:
Turán numbers for Berge-hypergraphs and related extremal problems. Discret. Math. 342(6): 1553-1563 (2019) - [j23]Vladislav Taranchuk, Craig Timmons:
The anti-Ramsey problem for the Sidon equation. Discret. Math. 342(10): 2856-2866 (2019) - [j22]Craig Timmons:
C2k -Saturated Graphs with No Short Odd Cycles. Graphs Comb. 35(5): 1023-1034 (2019) - 2018
- [j21]Vladimir Nikiforov, Michael Tait, Craig Timmons:
Degenerate Turán Problems for Hereditary Properties. Electron. J. Comb. 25(4): 4 (2018) - [j20]Po-Shen Loh, Michael Tait, Craig Timmons, Rodrigo M. Zhou:
Induced Turán Numbers. Comb. Probab. Comput. 27(2): 274-288 (2018) - [j19]Robert S. Coulter, Rex W. Matthews, Craig Timmons:
Planar polynomials and an extremal problem of Fischer and Matoušek. J. Comb. Theory B 128: 96-103 (2018) - 2017
- [j18]Craig Timmons:
On $r$-Uniform Linear Hypergraphs with no Berge-$K_{2, t}$. Electron. J. Comb. 24(4): 4 (2017) - [j17]Xing Peng, Craig Timmons:
A path Turán problem for infinite graphs. Discret. Math. 340(2): 181-191 (2017) - [j16]Thang Pham, Michael Tait, Craig Timmons, Le Anh Vinh:
A Szemerédi-Trotter type theorem, sum-product estimates in finite quasifields, and related results. J. Comb. Theory A 147: 55-74 (2017) - 2016
- [j15]Craig Timmons:
Upper Bounds for Bh[g]-sets With Small h. Integers 16: A83 (2016) - [j14]Michael Tait, Craig Timmons:
Orthogonal Polarity Graphs and Sidon Sets. J. Graph Theory 82(1): 103-116 (2016) - [j13]Michael Tait, Craig Timmons:
Independent Sets in Polarity Graphs. SIAM J. Discret. Math. 30(4): 2115-2129 (2016) - 2015
- [j12]Michael Tait, Craig Timmons:
Small dense subgraphs of polarity graphs and the extremal number for the 4-cycle. Australas. J Comb. 63: 107-114 (2015) - [j11]Xing Peng, Michael Tait, Craig Timmons:
On the Chromatic Number of the Erdős-Rényi Orthogonal Polarity Graph. Electron. J. Comb. 22(2): 2 (2015) - [j10]Xing Peng, Rafael Tesoro, Craig Timmons:
Bounds for generalized Sidon sets. Discret. Math. 338(3): 183-190 (2015) - [j9]Craig Timmons, Jacques Verstraëte:
A counterexample to sparse removal. Eur. J. Comb. 44: 77-86 (2015) - 2014
- [j8]Javier Cilleruelo, Craig Timmons:
k-Fold Sidon Sets. Electron. J. Comb. 21(4): 4 (2014) - [j7]Craig Timmons:
Upper and Lower Bounds on Bk+-Sets. Integers 14: A1 (2014) - [j6]Xing Peng, Craig Timmons:
Infinite Turán Problems for Bipartite Graphs. SIAM J. Discret. Math. 28(2): 702-710 (2014) - 2012
- [j5]Craig Timmons:
An Ordered Turán Problem for Bipartite Graphs. Electron. J. Comb. 19(4): 43 (2012) - 2011
- [j4]Sebastian M. Cioaba, André Kündgen, Craig Timmons, Vladislav V. Vysotsky:
Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs. Comb. Probab. Comput. 20(4): 519-527 (2011) - 2010
- [j3]André Kündgen, Craig Timmons:
Star coloring planar graphs from small lists. J. Graph Theory 63(4): 324-337 (2010)
2000 – 2009
- 2009
- [j2]Hal A. Kierstead, André Kündgen, Craig Timmons:
Star coloring bipartite planar graphs. J. Graph Theory 60(1): 1-10 (2009) - 2008
- [j1]Craig Timmons:
Star Coloring High Girth Planar Graphs. Electron. J. Comb. 15(1) (2008)
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 2024-10-07 22:16 CEST 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:
