Thomas A. McCourt

According to our database1, Thomas A. McCourt authored at least 15 papers between 2011 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On the upper embedding of Steiner triple systems and Latin squares.
Ars Math. Contemp., 2020

2018
A constructive characterisation of circuits in the simple (2, 1)-sparse matroid.
J. Graph Theory, 2018

2017
On which groups can arise as the canonical group of a spherical latin bitrade.
Ars Math. Contemp., 2017

Combinatorial Questions: How Can Graph Labelling Help?
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
Biembeddings of Symmetric n-Cycle Systems.
Graphs Comb., 2016

Growth Rates of Groups associated with Face 2-Coloured Triangulations and Directed Eulerian Digraphs on the Sphere.
Electron. J. Comb., 2016

Self-embeddings of doubled affine Steiner triple systems.
Australas. J Comb., 2016

2015
Further biembeddings of twofold triple systems.
Ars Math. Contemp., 2015

2014
Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph.
J. Graph Theory, 2014

Necessary Conditions for the Generic Global Rigidity of Frameworks on Surfaces.
Discret. Comput. Geom., 2014

Doubly Even Orientable Closed 2-cell Embeddings of the Complete Graph.
Electron. J. Comb., 2014

Triangulations of the sphere, bitrades and abelian groups.
Comb., 2014

2012
Identifying flaws in the security of critical sets in latin squares via triangulations.
Australas. J Comb., 2012

2011
The Disjoint <i>m</i>-Flower Intersection Problem for Latin Squares.
Electron. J. Comb., 2011

The triangle intersection problem for nested Steiner triple systems.
Australas. J Comb., 2011


  Loading...