๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The identification of a minimal feedback vertex set of a directed graph

โœ Scribed by Smith, G.; Walford, R.

Book ID
117913593
Publisher
IEEE
Year
1975
Weight
862 KB
Volume
22
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A new bound on the feedback vertex sets
A new bound on the feedback vertex sets in cubic graphs
โœ Jiping Liu; Cheng Zhao ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 461 KB

In this paper a new upper bound for the feedback set of cubic graphs is obtained. This result answers a question posed by Speckenmeyer (1986, 1988) in the field of feedback vertex set and improves several former results due to Bondy et al. (1987). Also this new bound is sharp in some cases.

A characterization of uniquely vertex co
A characterization of uniquely vertex colorable graphs using minimal defining sets
โœ H. Hajiabolhassan; M.L. Mehrabadi; R. Tusserkani; M. Zaker ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 267 KB

A defining set (sf cute-x coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We define a minimal d&kg set to be a defining set which does not properly contain another defining set. If G is a uniquely ver