Skip navigation
The Australian National University

Un-spanning trees

Ivan Lazar Miljenovic (ANU, Research School of Computer Science)

CS HDR MONITORING

DATE: 2012-11-30
TIME: 12:00:00 - 12:30:00
LOCATION: CSIT Seminar Room, N101
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
There are various ways of creating a spanning tree from a connected graph; however, is it possible to perform the reverse operation? In this talk, we shall discuss how to generate 3-connected cubic graphs via their spanning trees.

Updated:  15 November 2012 / Responsible Officer:  JavaScript must be enabled to display this email address. / Page Contact:  JavaScript must be enabled to display this email address.