Timothy J. Hetherington

According to our database, Timothy J. Hetherington authored at least 7 papers between 2003 and 2014.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2014

Coupled choosability of near-outerplanar graphs.

Timothy J. Hetherington

Ars Comb., 2014

2012

List total arboricity of 2-degenerate graphs.

Timothy J. Hetherington

Appl. Math. Lett., 2012

2011

List-colouring the square of an outerplanar graph.

Timothy J. Hetherington, Douglas R. Woodall

Ars Comb., 2011

2009

Entire choosability of near-outerplane graphs.

Timothy J. Hetherington

Discret. Math., 2009

2008

List-colouring the square of a K₄-minor-free graph.

Timothy J. Hetherington, Douglas R. Woodall

Discret. Math., 2008

2006

Edge and Total Choosability of Near-Outerplanar Graphs.

Timothy J. Hetherington, Douglas R. Woodall

Electron. J. Comb., 2006

2003

Functional Group Conflict in Information Systems Development.

John W. Lamp, Graeme Altmann, Timothy J. Hetherington

Proceedings of the Australasian Conference on Information Systems, 2003