![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Thomas A. McCourt
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j14]Terry S. Griggs, Thomas A. McCourt, Jozef Sirán:
On the upper embedding of Steiner triple systems and Latin squares. Ars Math. Contemp. 18(1): 127-135 (2020)
2010 – 2019
- 2018
- [j13]Thomas A. McCourt, Anthony Nixon
:
A constructive characterisation of circuits in the simple (2, 1)-sparse matroid. J. Graph Theory 89(2): 150-175 (2018) - 2017
- [j12]Kyle Bonetta-Martin, Thomas A. McCourt:
On which groups can arise as the canonical group of a spherical latin bitrade. Ars Math. Contemp. 13(1): 167-185 (2017) - [c1]Diane M. Donovan
, Thomas A. McCourt:
Combinatorial Questions: How Can Graph Labelling Help? IWOCA 2017: 13-23 - 2016
- [j11]Thomas A. McCourt, Justin Z. Schroeder:
Self-embeddings of doubled affine Steiner triple systems. Australas. J Comb. 66: 23-43 (2016) - [j10]Thomas A. McCourt:
Growth Rates of Groups associated with Face 2-Coloured Triangulations and Directed Eulerian Digraphs on the Sphere. Electron. J. Comb. 23(1): 1 (2016) - [j9]Terry S. Griggs, Thomas A. McCourt:
Biembeddings of Symmetric n-Cycle Systems. Graphs Comb. 32(1): 147-160 (2016) - 2015
- [j8]Diane M. Donovan, Terry S. Griggs, James G. Lefevre, Thomas A. McCourt:
Further biembeddings of twofold triple systems. Ars Math. Contemp. 8(2): 267-273 (2015) - 2014
- [j7]Simon R. Blackburn, Thomas A. McCourt:
Triangulations of the sphere, bitrades and abelian groups. Comb. 34(5): 527-546 (2014) - [j6]Mike J. Grannell, Thomas A. McCourt:
Doubly Even Orientable Closed 2-cell Embeddings of the Complete Graph. Electron. J. Comb. 21(1): 1 (2014) - [j5]Bill Jackson, Thomas A. McCourt, Anthony Nixon
:
Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces. Discret. Comput. Geom. 52(2): 344-360 (2014) - [j4]Thomas A. McCourt:
Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph. J. Graph Theory 77(1): 68-87 (2014) - 2012
- [j3]Diane M. Donovan, James G. Lefevre, Thomas A. McCourt, Nicholas J. Cavenagh, Abdollah Khodkar:
Identifying flaws in the security of critical sets in latin squares via triangulations. Australas. J Comb. 52: 243-268 (2012) - 2011
- [j2]Elizabeth J. Billington, Diane M. Donovan, James G. Lefevre, Thomas A. McCourt, Charles C. Lindner:
The triangle intersection problem for nested Steiner triple systems. Australas. J Comb. 51: 221-234 (2011) - [j1]James G. Lefevre, Thomas A. McCourt:
The Disjoint m-Flower Intersection Problem for Latin Squares. Electron. J. Comb. 18(1) (2011)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint