|
|||||
|
|
Unique factorization of compositive hereditary graph properties |
|
| Authors: | Izak Broere Ewa Drgas-Burchardt |
| Institution: | [1]Department of Mathematics, University of Johannesburg, P. O. Box 524, Auckland Park, 2006, South Africa [2]Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora, Prof. Z. Szafrana 4a, 65-516 Zielona Gora, Poland |
| Abstract: | A graph property is any class of graphs that is closed under isomorphisms. A graph property P is hereditary if it is closed under taking subgraphs; it is compositive if for any graphs G 1,G 2 ∈ P there exists a graph G ∈ P containing both G 1 and G 2 as subgraphs. |
| Keywords: | Graph property hereditary compositive property unique factorization minimal forbid-den graphs reducibility |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ | |