The decycling numbers of graphs

Simple item page
dc.creatorBau, S.
dc.creatorBeineke, L. W.
dc.date2007-03-19
dc.date.accessioned2026-07-07T07:52:37Z
dc.date.available2026-07-07T07:52:37Z
dc.descriptionFor a 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 a comprehensive review of recent results and several open problems on this graph parameter. Results to be reviewed include recent work on decycling numbers of cubes, grids and snakes. A structural description of graphs with a fixed decycling number based on connectivity is also presented. Graphs with small decycling numbers are characterized.
dc.identifierhttps://arxiv.org/abs/math/0703544
dc.identifierhttp://arxiv.org/abs/math/0703544
dc.identifierAustralasian Journal of Combinatorics 25(2002), 285-298
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/125944
dc.subjectCombinatorics
dc.subject05C38; 05C45
dc.titleThe decycling numbers of graphs
dc.typetext

Files

Collections

arXiv