Bert Calwell

Hubert James "Bert" Calwell (25 December 1898 – 1 July 1962)[2] was an Australian rules footballer who played with Hawthorn in the Victorian Football League (VFL).[3] He was a younger brother of George Calwell and Clarrie Calwell and served in World War I.[4]

Bert Calwell
Personal information
Full name Hubert James Calwell[1]
Date of birth (1898-12-25)25 December 1898
Place of birth Carlton, Victoria
Date of death 1 July 1962(1962-07-01) (aged 63)
Place of death Oakleigh, Victoria
Original team(s) Ringwood
Height 173 cm (5 ft 8 in)
Playing career1
Years Club Games (Goals)
1925–27 Hawthorn 29 (3)
1 Playing statistics correct to the end of 1927.
Sources: AFL Tables, AustralianFootball.com

He commenced his football career at Ringwood before joining Hawthorn for the 1925 VFL season.[5] He made his debut in Round 3 and played in every game from then on during their first season of VFL football. During the 1927 season he transferred to Camberwell Football Club.[6]

Notes

  1. "FOOTBALL PERMITS". The Argus. Melbourne: National Library of Australia. 30 April 1925. p. 15.
  2. "Bert Calwell – Player Bio". Australian Football. Retrieved 10 December 2014.
  3. Holmesby, Russell; Main, Jim (2009). The Encyclopedia of AFL Footballers: every AFL/VFL player since 1897 (8th ed.). Seaford, Victoria: BAS Publishing. ISBN 978-1-921496-00-4.
  4. "Hubert James Calwell". The AIF Project.
  5. "FOOTBALL". The Argus. Melbourne: National Library of Australia. 21 April 1925. p. 17.
  6. "Football". The Argus. Melbourne: National Library of Australia. 9 June 1927. p. 6. Retrieved 26 July 2014.
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees"; auto q = malloc(8); strcpy(q, s); printf("%s", q);}```
gollark: tio!debug
gollark: ```c#include <stdio.h>#include <stdio.h>#include <stdlib.h>#include <limits.h>#include <string.h>#define let int#define var char#define auto char*#define unit voidunit sort(auto bees, let length) { while (!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!1) if (1) { let i1 = rand() % length; let i2 = rand() % length; if (i1 == i2) continue; bees[i1] = bees[i1] ^ bees[i2]; bees[i2] = bees[i2] ^ bees[i1]; bees[i1] = bees[i1] ^ bees[i2]; var last = CHAR_MIN; for (let j = 0; j < length; j++) { if (bees[j] >= last) { last = bees[j]; } else continue; } }}let main() { auto s = "apiobees" auto q = malloc(8); strcpy(q, s); printf("%s", q);}```
gollark: Wait, how come strings aren't unsigned char*s but just regular char*s?
gollark: You swap random elements until it's sorted.


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.