Select Publications

Software / Code

Britz T; Bright D; Snoyman R, 2019, Criminal Networks, Published: 2019, Software / Code, https://rsnoyman.shinyapps.io/criminal_networks/

Britz T; Britz D; Sørensen HK, 2007, Fast Tutte polynomial calculator, Maple, C++, Fortran, Published: 22 August 2007, Software / Code, http://www.thomasbritz.dk/notes/TuttePol-02a01.zip

Theses / Dissertations

Britz T, 2003, Matroids, Codes and Relations, University of Aarhus

Recorded / Rendered Creative Works

Britz T, 2022, How to create a supportive learning community, UNSW eLearning, Editor(s): Britz T, Published: 07 March 2022, Duration: 00:13:39, Recorded / Rendered Creative Works, https://youtu.be/ij8JYS2f6Og

Britz T, 2019, The Emotions of Mathematics, TEDx Talks, YouTube, Editor(s): TEDxUNSW , Published: 12 April 2019, Duration: 00:14:31, Recorded / Rendered Creative Works, https://youtu.be/Pp63Ot_l6Yk

Media

Britz T, 2023, The beauty of the Golden Ratio, Faculti Media Limited, , https://faculti.net/the-beauty-of-the-golden-ratio/

Britz T, 2023, What is combinatorics?, Faculti Media Limited, , https://faculti.net/what-is-combinatorics/

Britz T; Gilmore N; Malerba M, 2023, Farmers are famously self-reliant. Why not use farm dams as mini-hydro plants?, The Conversation Media Group Ltd, , http://dx.doi.org/10.26190/unsworks/28641

Britz T, 2022, The history and mystery of Tangram, the children's puzzle game that harbours a mathematical paradox or two, The Conversation Media Group Ltd, , https://theconversation.com/the-history-and-mystery-of-tangram-the-childrens-puzzle-game-that-harbours-a-mathematical-paradox-or-two-190529

Britz T, 2022, Does Amber Heard really have the world’s most beautiful face? An expert explains why the Golden Ratio test is bogus, The Conversation Media Group Ltd, , http://dx.doi.org/10.26190/unsworks/28329

Preprints

Britz T; Chakraborty HS; Miezaki T, 2024, Harmonic Tutte polynomials of matroids III, , http://arxiv.org/abs/2405.16948v1

Chng ZY; Britz T; Tan TS; Wong KB, 2024, The Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nine, , http://dx.doi.org/10.48550/arxiv.2403.02593

Abel RJR; Britz T; Bunjamin YA; Combe D, 2024, Direct constructions of some group divisible designs with block size $4$ and up to $50$ points, , http://arxiv.org/abs/2401.11809v1

Britz T; Hu X; Islam A; Tang HC, 2022, Bounds on the closeness centrality of a graph, , http://arxiv.org/abs/2204.11283v2

Other

Henry B; Britz T; Schumacher E; Marschalek R; Zacarelli Denke R; Bojanic Helbingen C; Zayas Claure CD; Humenberger H; Fallas-Monge JJ; Durán Silva R; Jupri A; Kageyama K; Ishibashi I; Ávila Pozos O; Rivera I; Voss P; Panduro Urrelo HE; Karas S; Ruminska M; Sulitsa | O; Romanchuck V; Tolmachev Y, 2018, MATHBRIDGES Calendar, University of Münster, , https://www.uni-muenster.de/imperia/md/content/afo/news/afo-kalender_mathebruecken_web.pdf


Back to profile page