✦ LIBER ✦

Unique factorization of compositive hereditary graph properties

✍ Scribed by Izak Broere; Ewa Drgas-Burchardt

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2011
Tongue: English
Weight: 274 KB
Volume: 28
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-011-0111-y

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

Factorizations and characterizations of

Factorizations and characterizations of induced-hereditary and compositive properties

✍ Alastair Farrugia; Peter Mihók; R. Bruce Richter; Gabriel Semanivšin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## Abstract An Erratum has been published for this article in Journal of Graph Theory 50:261, 2005. A graph property (i.e., a set of graphs) is hereditary (respectively, induced‐hereditary) if it is closed under taking subgraphs (resp., induced‐subgraphs), while the property is additive if it is c

Erratum to: Factorizations and character

Erratum to: Factorizations and characterizations of induced-hereditary and compositive properties

✍ Alastair Farrugia; Peter Mihók; R. Bruce Richter; Gabriel Semanišin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 28 KB

## Abstract The original article to which this Erratum refers was published in Journal of Graph Theory 49:11–27. No Abstract.

On uniqueness of a general factorization

On uniqueness of a general factorization of graph properties

✍ Ewa Drgas-Burchardt 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract A graph property is any class of simple graphs, which is closed under isomorphisms. Let __H__ be a given graph on vertices __v__~1~, …, __v__~__n__~. For graph properties 𝒫~1~, …, 𝒫~__n__~, we denote by __H__[𝒫~1~, …, 𝒫~__n__~] the class of those (𝒫~1~, …, 𝒫~__n__~) ‐partitionable grap

Thef-factor Problem for Graphs and the H

Thef-factor Problem for Graphs and the Hereditary Property

✍ Frank Niedermeyer; Saharon Shelah; Karsten Steffens 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 149 KB

The Speed of Hereditary Properties of Gr

The Speed of Hereditary Properties of Graphs

✍ József Balogh; Béla Bollobás; David Weinreich 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Given a property P of graphs, write P n for the set of graphs with vertex set [n] having property P. The growth or speed of a property P can be discussed in terms of the values of |P n |. For properties with |P n | <n n hereditary properties are surprisingly well determined by their speeds. Sharpeni