Temat: hereditary property of graphs - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Reducible properties of graphs
Autorzy:: Mihók, P.
Semanišin, G.
Powiązania:: https://bibliotekanauki.pl/articles/972021.pdf
Data publikacji:: 1995
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: hereditary property of graphs
additivity
reducibility
Opis:: Let L be the set of all hereditary and additive properties of graphs. For P₁, P₂ ∈ L, the reducible property R = P₁∘P₂ is defined as follows: G ∈ R if and only if there is a partition V(G) = V₁∪ V₂ of the vertex set of G such that $⟨V₁⟩_G ∈ P₁$ and $⟨V₂⟩_G ∈ P₂$. The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the decomposition of a reducible property into irreducible ones.
Źródło:: Discussiones Mathematicae Graph Theory; 1995, 15, 1; 11-18
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: On the factorization of reducible properties of graphs into irreducible factors
Autorzy:: Mihók, P.
Vasky, R.
Powiązania:: https://bibliotekanauki.pl/articles/972030.pdf
Data publikacji:: 1995
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: hereditary property of graphs
additivity
reducibility
vertex partition
Opis:: A hereditary property R of graphs is said to be reducible if there exist hereditary properties P₁,P₂ such that G ∈ R if and only if the set of vertices of G can be partitioned into V(G) = V₁∪V₂ so that ⟨V₁⟩ ∈ P₁ and ⟨V₂⟩ ∈ P₂. The problem of the factorization of reducible properties into irreducible factors is investigated.
Źródło:: Discussiones Mathematicae Graph Theory; 1995, 15, 2; 195-203
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Uniquely partitionable graphs
Autorzy:: Bucko, Jozef
Frick, Marietjie
Mihók, Peter
Vasky, Roman
Powiązania:: https://bibliotekanauki.pl/articles/972032.pdf
Data publikacji:: 1997
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: hereditary property of graphs
additivity
reducibility
vertex partition
Opis:: Let ₁,...,ₙ be properties of graphs. A (₁,...,ₙ)-partition of a graph G is a partition of the vertex set V(G) into subsets V₁, ...,Vₙ such that the subgraph $G[V_i]$ induced by $V_i$ has property $_i$; i = 1,...,n. A graph G is said to be uniquely (₁, ...,ₙ)-partitionable if G has exactly one (₁,...,ₙ)-partition. A property is called hereditary if every subgraph of every graph with property also has property . If every graph that is a disjoint union of two graphs that have property also has property , then we say that is additive. A property is called degenerate if there exists a bipartite graph that does not have property . In this paper, we prove that if ₁,..., ₙ are degenerate, additive, hereditary properties of graphs, then there exists a uniquely (₁,...,ₙ)-partitionable graph.
Źródło:: Discussiones Mathematicae Graph Theory; 1997, 17, 1; 103-113
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 4.

Tytuł:: On generating sets of induced-hereditary properties
Autorzy:: Semanišin, Gabriel
Powiązania:: https://bibliotekanauki.pl/articles/743561.pdf
Data publikacji:: 2002
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: induced-hereditary property of graphs
additivity
reducibility
generating sets
maximal graphs
unique factorization
Opis:: A natural generalization of the fundamental graph vertex-colouring problem leads to the class of problems known as generalized or improper colourings. These problems can be very well described in the language of reducible (induced) hereditary properties of graphs. It turned out that a very useful tool for the unique determination of these properties are generating sets. In this paper we focus on the structure of specific generating sets which provide the base for the proof of The Unique Factorization Theorem for induced-hereditary properties of graphs.
Źródło:: Discussiones Mathematicae Graph Theory; 2002, 22, 1; 183-192
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja