Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "induced-hereditary" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    Unique factorisation of additive induced-hereditary properties
    Autorzy:
    Farrugia, Alastair
    Richter, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/744519.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    additive and hereditary graph classes
    unique factorization
    Opis:
    An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ₁,...,ₙ be additive hereditary graph properties. A graph G has property (₁∘...∘ₙ) if there is a partition (V₁,...,Vₙ) of V(G) into n sets such that, for all i, the induced subgraph $G[V_i]$ is in $_i$. A property is reducible if there are properties , such that = ∘ ; otherwise it is irreducible. Mihók, Semanišin and Vasky [8] gave a factorisation for any additive hereditary property into a given number dc() of irreducible additive hereditary factors. Mihók [7] gave a similar factorisation for properties that are additive and induced-hereditary (closed under taking induced-subgraphs and disjoint unions). Their results left open the possiblity of different factorisations, maybe even with a different number of factors; we prove here that the given factorisations are, in fact, unique.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2004, 24, 2; 319-343
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    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ł
    Tytuł:
    Universality for and in Induced-Hereditary Graph Properties
    Autorzy:
    Broere, Izak
    Heidema, Johannes
    Powiązania:
    https://bibliotekanauki.pl/articles/30146860.pdf
    Data publikacji:
    2013-03-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    countable graph
    universal graph
    induced-hereditary property
    Opis:
    The well-known Rado graph $R$ is universal in the set of all countable graphs \( \mathcal{I} \), since every countable graph is an induced subgraph of $R$. We study universality in \( \mathcal{I} \) and, using $R$, show the existence of $2^{\aleph_0}$ pairwise non-isomorphic graphs which are universal in \( \mathcal{I} \) and denumerably many other universal graphs in \( \mathcal{I} \) with prescribed attributes. Then we contrast universality for and universality in induced-hereditary properties of graphs and show that the overwhelming majority of induced-hereditary properties contain no universal graphs. This is made precise by showing that there are $ 2^{2^{\aleph_0 } }$ properties in the lattice $ \mathbb{K}_\le $ of induced-hereditary properties of which only at most $ 2^{\aleph_0} $ contain universal graphs. In a final section we discuss the outlook on future work; in particular the question of characterizing those induced-hereditary properties for which there is a universal graph in the property.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2013, 33, 1; 33-47
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Prime ideals in the lattice of additive induced-hereditary graph properties
    Autorzy:
    Berger, Amelie
    Mihók, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/743387.pdf
    Data publikacji:
    2003
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hereditary graph property
    prime ideal
    distributive lattice
    induced subgraphs
    Opis:
    An additive induced-hereditary property of graphs is any class of finite simple graphs which is closed under isomorphisms, disjoint unions and induced subgraphs. The set of all additive induced-hereditary properties of graphs, partially ordered by set inclusion, forms a completely distributive lattice. We introduce the notion of the join-decomposability number of a property and then we prove that the prime ideals of the lattice of all additive induced-hereditary properties are divided into two groups, determined either by a set of excluded join-irreducible properties or determined by a set of excluded properties with infinite join-decomposability number. We provide non-trivial examples of each type.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2003, 23, 1; 117-127
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Criteria for of the existence of uniquely partitionable graphs with respect to additive induced-hereditary properties
    Autorzy:
    Broere, Izak
    Bucko, Jozef
    Mihók, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/743535.pdf
    Data publikacji:
    2002
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    induced-hereditary properties
    reducibility
    divisibility
    uniquely partitionable graphs.
    Opis:
    Let ₁,₂,...,ₙ be graph properties, a graph G is said to be uniquely (₁,₂, ...,ₙ)-partitionable if there is exactly one (unordered) partition {V₁,V₂,...,Vₙ} of V(G) such that $G[V_i] ∈ _i$ for i = 1,2,...,n. We prove that for additive and induced-hereditary properties uniquely (₁,₂,...,ₙ)-partitionable graphs exist if and only if $_i$ and $_j$ are either coprime or equal irreducible properties of graphs for every i ≠ j, i,j ∈ {1,2,...,n}.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2002, 22, 1; 31-37
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Sum-List Colouring of Unions of a Hypercycle and a Path with at Most Two Vertices in Common
    Autorzy:
    Drgas-Burchardt, Ewa
    Sidorowicz, Elżbieta
    Powiązania:
    https://bibliotekanauki.pl/articles/31527293.pdf
    Data publikacji:
    2020-08-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    hypergraphs
    sum-list colouring
    induced hereditary classes
    forbidden hypergraphs
    Opis:
    Given a hypergraph \(\mathcal{H}\) and a function \(f : V (\mathcal{H}) → ℕ\), we say that \(\mathcal{H}\) is $f$-choosable if there is a proper vertex colouring $ϕ$ of \(\mathcal{H}\) such that $ϕ (v) ∈ L(v)$ for all \(v ∈ V (\mathcal{H})\), where \(L : V (\mathcal{H}) → 2^ℕ\) is any assignment of $f(v)$ colours to a vertex $v$. The sum choice number \(\mathcal{H}i_{sc}(\mathcal{H})\) of \(\mathcal{H}\) is defined to be the minimum of \(Σ_{v∈V(\mathcal{H})}f(v)\) over all functions $f$ such that \(\mathcal{H}\) is $f$-choosable. For an arbitrary hypergraph \(\mathcal{H}\) the inequality \(χ_{sc}(\mathcal{H}) ≤ |V (\mathcal{H})| + |ɛ (\mathcal{H})|\) holds, and hypergraphs that attain this upper bound are called $sc$-greedy. In this paper we characterize $sc$-greedy hypergraphs that are unions of a hypercycle and a hyperpath having at most two vertices in common. Consequently, we characterize the hypergraphs of this type that are forbidden for the class of $sc$-greedy hypergraphs.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2020, 40, 3; 893-917
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    \( \mathcal{P} \)-Apex Graphs
    Autorzy:
    Borowiecki, Mieczysław
    Drgas-Burchardt, Ewa
    Sidorowicz, Elżbieta
    Powiązania:
    https://bibliotekanauki.pl/articles/31342421.pdf
    Data publikacji:
    2018-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    induced hereditary classes of graphs
    forbidden subgraphs
    hypergraphs
    transversal number
    Opis:
    Let \( \mathcal{P} \) be an arbitrary class of graphs that is closed under taking induced subgraphs and let \( \mathcal{C}( \mathcal{P} ) \) be the family of forbidden subgraphs for \( \mathcal{P} \). We investigate the class \( \mathcal{P} (k) \) consisting of all the graphs \( G \) for which the removal of no more than \( k \) vertices results in graphs that belong to \( \mathcal{P} \). This approach provides an analogy to apex graphs and apex-outerplanar graphs studied previously. We give a sharp upper bound on the number of vertices of graphs in \( \mathcal{C}( \mathcal{P}(1)) \) and we give a construction of graphs in \( \mathcal{C}( \mathcal{P}(k)) \) of relatively large order for \( k \ge 2 \). This construction implies a lower bound on the maximum order of graphs in \( \mathcal{C}( \mathcal{P}(k)) \). Especially, we investigate \( \mathcal{C}( \mathcal{W}_r(1)) \), where \( \mathcal{W}_r \) denotes the class of \( \mathcal{P}_r \)-free graphs. We determine some forbidden subgraphs for the class \( \mathcal{W}_r(1) \) with the minimum and maximum number of vertices. Moreover, we give sufficient conditions for graphs belonging to \( \mathcal{C} ( \mathcal{P} (k)) \), where \( \mathcal{P} \) is an additive class, and a characterisation of all forests in \( \mathcal{C} ( \mathcal{P} (k)) \). Particularly we deal with \( \mathcal{C} ( \mathcal{P} (1)) \), where \( \mathcal{P} \) is a class closed under substitution and obtain a characterisation of all graphs in the corresponding \( \mathcal{C} ( \mathcal{P} (1)) \). In order to obtain desired results we exploit some hypergraph tools and this technique gives a new result in the hypergraph theory.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2018, 38, 2; 323-349
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Gallais innequality for critical graphs of reducible hereditary properties
    Autorzy:
    Mihók, Peter
    Skrekovski, Riste
    Powiązania:
    https://bibliotekanauki.pl/articles/743466.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    additive induced-hereditary property of graphs
    reducible property of graphs
    critical graph
    Gallai's Theorem
    Opis:
    In this paper Gallai's inequality on the number of edges in critical graphs is generalized for reducible additive induced-hereditary properties of graphs in the following way. Let $₁,₂,...,ₖ$ (k ≥ 2) be additive induced-hereditary properties, $ = ₁ ∘ ₂ ∘ ... ∘ₖ$ and $δ = ∑_{i=1}^k δ(_i)$. Suppose that G is an -critical graph with n vertices and m edges. Then 2m ≥ δn + (δ-2)/(δ²+2δ-2)*n + (2δ)/(δ²+2δ-2) unless = ² or $G = K_{δ+1}$. The generalization of Gallai's inequality for -choice critical graphs is also presented.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2001, 21, 2; 167-177
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Unique factorization theorem
    Autorzy:
    Mihók, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/743745.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    induced-hereditary
    additive property of graphs
    reducible property of graphs
    unique factorization
    uniquely partitionable graphs
    generating sets
    Opis:
    A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induced-hereditary and additive if it is closed under taking induced subgraphs and disjoint unions of graphs, respectively. Let ₁,₂, ...,ₙ be properties of graphs. A graph G is (₁,₂,...,ₙ)-partitionable (G has property ₁ º₂ º... ºₙ) if the vertex set V(G) of G can be partitioned into n sets V₁,V₂,..., Vₙ such that the subgraph $G[V_i]$ of G induced by V_i belongs to $_i$; i = 1,2,...,n. A property is said to be reducible if there exist properties ₁ and ₂ such that = ₁ º₂; otherwise the property is irreducible. We prove that every additive and induced-hereditary property is uniquely factorizable into irreducible factors. Moreover the unique factorization implies the existence of uniquely (₁,₂, ...,ₙ)-partitionable graphs for any irreducible properties ₁,₂, ...,ₙ.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2000, 20, 1; 143-154
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Universality in Graph Properties with Degree Restrictions
    Autorzy:
    Broere, Izak
    Heidema, Johannes
    Mihók, Peter
    Powiązania:
    https://bibliotekanauki.pl/articles/30146518.pdf
    Data publikacji:
    2013-07-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    countable graph
    universal graph
    induced-hereditary
    k-degenerate graph
    graph with colouring number at most k + 1
    graph property with assignment
    Opis:
    Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R is a universal graph in the set ℐc of all countable graphs (since every graph in ℐc is isomorphic to an induced subgraph of R). A brief overview of known universality results for some induced-hereditary subsets of ℐc is provided. We then construct a k-degenerate graph which is universal for the induced-hereditary property of finite k-degenerate graphs. In order to attempt the corresponding problem for the property of countable graphs with colouring number at most k + 1, the notion of a property with assignment is introduced and studied. Using this notion, we are able to construct a universal graph in this graph property and investigate its attributes.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2013, 33, 3; 477-492
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The Quest for A Characterization of Hom-Properties of Finite Character
    Autorzy:
    Broere, Izak
    Matsoha, Moroli D.V.
    Heidema, Johannes
    Powiązania:
    https://bibliotekanauki.pl/articles/31340894.pdf
    Data publikacji:
    2016-05-01
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    (countable) graph
    homomorphism (of graphs)
    property of graphs
    hom-property
    (finitely-)induced-hereditary property
    finitely determined property
    (weakly) finite character
    axiomatizable property
    compactness theorems
    core
    connectedness
    chromatic number
    clique number
    independence number
    dominating set
    Opis:
    A graph property is a set of (countable) graphs. A homomorphism from a graph \( G \) to a graph \( H \) is an edge-preserving map from the vertex set of \( G \) into the vertex set of \( H \); if such a map exists, we write \( G \rightarrow H \). Given any graph \( H \), the hom-property \( \rightarrow H \) is the set of \( H \)-colourable graphs, i.e., the set of all graphs \( G \) satisfying \( G \rightarrow H \). A graph property \( mathcal{P} \) is of finite character if, whenever we have that \( F \in \mathcal{P} \) for every finite induced subgraph \( F \) of a graph \( G \), then we have that \( G \in \mathcal{P} \) too. We explore some of the relationships of the property attribute of being of finite character to other property attributes such as being finitely-induced-hereditary, being finitely determined, and being axiomatizable. We study the hom-properties of finite character, and prove some necessary and some sufficient conditions on \( H \) for \( \rightarrow H \) to be of finite character. A notable (but known) sufficient condition is that \( H \) is a finite graph, and our new model-theoretic proof of this compactness result extends from hom-properties to all axiomatizable properties. In our quest to find an intrinsic characterization of those \( H \) for which \( \rightarrow H \) is of finite character, we find an example of an infinite connected graph with no finite core and chromatic number 3 but with hom-property not of finite character.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2016, 36, 2; 479-500
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Graphs with small additive stretch number
    Autorzy:
    Rautenbach, Dieter
    Powiązania:
    https://bibliotekanauki.pl/articles/744511.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    stretch number
    distance hereditary graph
    forbidden induced subgraph
    Opis:
    The additive stretch number $s_{add}(G)$ of a graph G is the maximum difference of the lengths of a longest induced path and a shortest induced path between two vertices of G that lie in the same component of G.We prove some properties of minimal forbidden configurations for the induced-hereditary classes of graphs G with $s_{add}(G) ≤ k$ for some k ∈ N₀ = {0,1,2,...}. Furthermore, we derive characterizations of these classes for k = 1 and k = 2.
    Źródło:
    Discussiones Mathematicae Graph Theory; 2004, 24, 2; 291-301
    2083-5892
    Pojawia się w:
    Discussiones Mathematicae Graph Theory
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Hereditarily weakly confluent induced mappings are homeomorphisms
    Autorzy:
    Charatonik, Janusz
    Charatonik, Włodzimierz
    Powiązania:
    https://bibliotekanauki.pl/articles/966016.pdf
    Data publikacji:
    1998
    Wydawca:
    Polska Akademia Nauk. Instytut Matematyczny PAN
    Tematy:
    atriodic
    semi-confluent
    hereditary
    confluent
    atomic
    homeomorphism
    cone
    weakly confluent
    monotone
    hyperspace
    joining
    continuum
    Opis:
    For a given mapping f between continua we consider the induced mappings between the corresponding hyperspaces of closed subsets or of subcontinua. It is shown that if either of the two induced mappings is hereditarily weakly confluent (or hereditarily confluent, or hereditarily monotone, or atomic), then f is a homeomorphism, and consequently so are both the induced mappings. Similar results are obtained for mappings between cones over the domain and over the range continua.
    Źródło:
    Colloquium Mathematicum; 1998, 75, 2; 195-203
    0010-1354
    Pojawia się w:
    Colloquium Mathematicum
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-13 z 13

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies