Atlas home || Conferences | Abstracts | about Atlas

25th Australasian Conference on Combinatorial Mathematics and Combinatorial Computing
December 4-8, 2000
University of Canterbury
Christchurch, New Zealand

Organizers
Charles Semple, Mike Steel

View Abstracts
Conference Homepage

The decycling number of graphs
by
Sheng Bau
University of Natal

For graph G and S subset V(G), if G - S is acyclic, then S is said to be a decycling set of G. The size of a smallest decycling set of G is called the decycling number of G. The purpose of this paper is to provide a review of recent results and open problems on this parameter.

Date received: October 9, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafn-16.