𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Thef-factor Problem for Graphs and the Hereditary Property

✍ Scribed by Frank Niedermeyer; Saharon Shelah; Karsten Steffens

Publisher
Springer
Year
2006
Tongue
English
Weight
149 KB
Volume
45
Category
Article
ISSN
0933-5846

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Additive and hereditary properties of gr
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
✍ MihοΏ½k, Peter; Semani?in, Gabriel; Vasky, Roman πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 210 KB πŸ‘ 2 views

A hereditary property of graphs is any class of graphs closed under isomorphism and subgraphs. Let P 1 , P 2 , . . . , P n be hereditary properties of graphs. We say that a graph G has property P 1 . . , V n such that the subgraph of G induced by V i belongs to P i ; i = 1, 2, . . . , n. A heredita

On easy and hard hereditary classes of g
On easy and hard hereditary classes of graphs with respect to the independent set problem
✍ Vladimir E. Alekseev πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 162 KB

In this paper we introduce the concept of a boundary class, which is a helpful tool for classiΓΏcation of hereditary classes of graphs according to the complexity of the independent set problem. It is shown that in a class X deΓΏned by a ΓΏnite set of forbidden induced subgraphs, the problem is NP-hard