FEEDBACK VERTEX SET ON PLANAR GRAPHS

dc.citation.epage	2082	en_US
dc.citation.issue	6	en_US
dc.citation.spage	2077	en_US
dc.citation.volume	16	en_US
dc.citation.woscount	0
dc.contributor.author	Chen, Hong-Bin	en_US
dc.contributor.author	Fu, Hung-Lin	en_US
dc.contributor.author	Shih, Chie-Huai	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.date.accessioned	2014-12-08T15:31:35Z
dc.date.available	2014-12-08T15:31:35Z
dc.date.issued	2012-12-01	en_US
dc.description.abstract	A feedback vertex set of a graph is a set of vertices whose removal results an acyclic graph. This paper shows that for every planar graph the minimum cardinality of a feedback vertex set is at most three times the maximum number of vertex disjoint cycles in the graph.	en_US
dc.identifier.issn	1027-5487	en_US
dc.identifier.journal	TAIWANESE JOURNAL OF MATHEMATICS	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/22398
dc.identifier.wosnumber	WOS:000319540700009
dc.language.iso	en_US	en_US
dc.subject	Feedback vertex set	en_US
dc.subject	Vertex disjoint cycle	en_US
dc.subject	Cycle packing number	en_US
dc.title	FEEDBACK VERTEX SET ON PLANAR GRAPHS	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1