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ę "hereditary" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 85
Tytuł:
Bacterial DNA repair genes and their eukaryotic homologues: 2. Role of bacterial mutator gene homologues in human disease. Overview of nucleotide pool sanitization and mismatch repair systems
Autorzy:
Arczewska, Katarzyna
Kuśmierek, Jarosław
Powiązania:
https://bibliotekanauki.pl/articles/1040920.pdf
Data publikacji:
2007
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
MutT protein
human MutT homologue
DNA damage
mismatch repair
hereditary non-polyposis colorectal cancer
DNA repair
Opis:
Since the discovery of the first E. coli mutator gene, mutT, most of the mutations inducing elevated spontaneous mutation rates could be clearly attributed to defects in DNA repair. MutT turned out to be a pyrophosphohydrolase hydrolyzing 8-oxodGTP, thus preventing its incorporation into DNA and suppresing the occurrence of spontaneous AT→CG transversions. Most of the bacterial mutator genes appeared to be evolutionarily conserved, and scientists were continuously searching for contribution of DNA repair deficiency in human diseases, especially carcinogenesis. Yet a human MutT homologue - hMTH1 protein - was found to be overexpressed rather than inactivated in many human diseases, including cancer. The interest in DNA repair contribution to human diseases exploded with the observation that germline mutations in mismatch repair (MMR) genes predispose to hereditary non-polyposis colorectal cancer (HNPCC). Despite our continuously growing knowledge about DNA repair we still do not fully understand how the mutator phenotype contributes to specific forms of human diseases.
Źródło:
Acta Biochimica Polonica; 2007, 54, 3; 435-457
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimal reducible bounds for hom-properties of graphs
Autorzy:
Berger, Amelie
Broere, Izak
Powiązania:
https://bibliotekanauki.pl/articles/744144.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph homomorphisms
minimal reducible bounds
additive hereditary graph property
Opis:
Let H be a fixed finite graph and let → H be a hom-property, i.e. the set of all graphs admitting a homomorphism into H. We extend the definition of → H to include certain infinite graphs H and then describe the minimal reducible bounds for → H in the lattice of additive hereditary properties and in the lattice of hereditary properties.
Źródło:
Discussiones Mathematicae Graph Theory; 1999, 19, 2; 143-158
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ł:
\( \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ł:
A survey of hereditary properties of graphs
Autorzy:
Borowiecki, Mieczysław
Broere, Izak
Frick, Marietjie
Mihók, Peter
Semanišin, Gabriel
Powiązania:
https://bibliotekanauki.pl/articles/971986.pdf
Data publikacji:
1997
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hereditary property of graphs
vertex partition
reducible property
graph invariants
complexity
Opis:
In this paper we survey results and open problems on the structure of additive and hereditary properties of graphs. The important role of vertex partition problems, in particular the existence of uniquely partitionable graphs and reducible properties of graphs in this structure is emphasized. Many related topics, including questions on the complexity of related problems, are investigated.
Źródło:
Discussiones Mathematicae Graph Theory; 1997, 17, 1; 5-50
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Acyclic reducible bounds for outerplanar graphs
Autorzy:
Borowiecki, Mieczysław
Fiedorowicz, Anna
Hałuszczak, Mariusz
Powiązania:
https://bibliotekanauki.pl/articles/743164.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph
acyclic colouring
additive hereditary class
outerplanar graph
Opis:
For a given graph G and a sequence ₁, ₂,..., ₙ of additive hereditary classes of graphs we define an acyclic (₁, ₂,...,Pₙ)-colouring of G as a partition (V₁, V₂,...,Vₙ) of the set V(G) of vertices which satisfies the following two conditions:
1. $G[V_i] ∈ _i$ for i = 1,...,n,
2. for every pair i,j of distinct colours the subgraph induced in G by the set of edges uv such that $u ∈ V_i$ and $v ∈ V_j$ is acyclic.
A class R = ₁ ⊙ ₂ ⊙ ... ⊙ ₙ is defined as the set of the graphs having an acyclic (₁, ₂,...,Pₙ)-colouring. If ⊆ R, then we say that R is an acyclic reducible bound for . In this paper we present acyclic reducible bounds for the class of outerplanar graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2009, 29, 2; 219-239
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized domination, independence and irredudance in graphs
Autorzy:
Borowiecki, Mieczysław
Michalak, Danuta
Sidorowicz, Elżbieta
Powiązania:
https://bibliotekanauki.pl/articles/971966.pdf
Data publikacji:
1997
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hereditary property of graphs
generalized domination
independence and irredundance numbers
Opis:
The purpose of this paper is to present some basic properties of -dominating, -independent, and -irredundant sets in graphs which generalize well-known properties of dominating, independent and irredundant sets, respectively.
Źródło:
Discussiones Mathematicae Graph Theory; 1997, 17, 1; 147-153
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized list colourings of graphs
Autorzy:
Borowiecki, Mieczysław
Drgas-Burchardt, Ewa
Mihók, Peter
Powiązania:
https://bibliotekanauki.pl/articles/972045.pdf
Data publikacji:
1995
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hereditary property of graphs
list colouring
vertex partition number
Opis:
We prove: (1) that $ch_P(G) - χ_P(G)$ can be arbitrarily large, where $ch_P(G)$ and $χ_P(G)$ are P-choice and P-chromatic numbers, respectively, (2) the (P,L)-colouring version of Brooks' and Gallai's theorems.
Źródło:
Discussiones Mathematicae Graph Theory; 1995, 15, 2; 185-193
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Generalized total colorings of graphs
Autorzy:
Borowiecki, Mieczysław
Kemnitz, Arnfried
Marangio, Massimiliano
Mihók, Peter
Powiązania:
https://bibliotekanauki.pl/articles/743865.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hereditary properties
generalized total colorings
paths
cycles
complete graphs
Opis:
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let P and Q be additive hereditary properties of graphs. A (P,Q)-total coloring of a simple graph G is a coloring of the vertices V(G) and edges E(G) of G such that for each color i the vertices colored by i induce a subgraph of property P, the edges colored by i induce a subgraph of property Q and incident vertices and edges obtain different colors. In this paper we present some general basic results on (P,Q)-total colorings. We determine the (P,Q)-total chromatic number of paths and cycles and, for specific properties, of complete graphs. Moreover, we prove a compactness theorem for (P,Q)-total colorings.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 2; 209-222
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hamiltonicity and Generalised Total Colourings of Planar Graphs
Autorzy:
Borowiecki, Mieczysław
Broere, Izak
Powiązania:
https://bibliotekanauki.pl/articles/31341094.pdf
Data publikacji:
2016-05-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
even planar triangulation
total colouring
Hamilton cycle
hereditary property
Opis:
The total generalised colourings considered in this paper are colourings of graphs such that the vertices and edges of the graph which receive the same colour induce subgraphs from two prescribed hereditary graph properties while incident elements receive different colours. The associated total chromatic number is the least number of colours with which this is possible. We study such colourings for sets of planar graphs and determine, in particular, upper bounds for these chromatic numbers for proper colourings of the vertices while the monochromatic edge sets are allowed to be forests. We also prove that if an even planar triangulation has a Hamilton cycle H for which there is no cycle among the edges inside H, then such a graph needs at most four colours for a total colouring as described above. The paper is concluded with some conjectures and open problems.
Źródło:
Discussiones Mathematicae Graph Theory; 2016, 36, 2; 243-257
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On generalized list colourings of graphs
Autorzy:
Borowiecki, Mieczysław
Broere, Izak
Mihók, Peter
Powiązania:
https://bibliotekanauki.pl/articles/972024.pdf
Data publikacji:
1997
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hereditary property of graphs
list colouring
vertex partition number
Opis:
Vizing [15] and Erdős et al. [8] independently introduce the idea of considering list-colouring and k-choosability. In the both papers the choosability version of Brooks' theorem [4] was proved but the choosability version of Gallai's theorem [9] was proved independently by Thomassen [14] and by Kostochka et al. [11]. In [3] some extensions of these two basic theorems to (,k)-choosability have been proved.
In this paper we prove some extensions of the well-known bounds for the -chromatic number to the (,k)-choice number and then an extension of Brooks' theorem.
Źródło:
Discussiones Mathematicae Graph Theory; 1997, 17, 1; 127-132
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On partitions of hereditary properties of graphs
Autorzy:
Borowiecki, Mieczysław
Fiedorowicz, Anna
Powiązania:
https://bibliotekanauki.pl/articles/743575.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
hereditary property
acyclic colouring
Ramsey class
Opis:
In this paper a concept -Ramsey Class of graphs is introduced, where is a class of bipartite graphs. It is a generalization of well-known concept of Ramsey Class of graphs. Some -Ramsey Classes of graphs are presented (Theorem 1 and 2). We proved that ₂, the class of all outerplanar graphs, is not ₁-Ramsey Class (Theorem 3). This results leads us to the concept of acyclic reducible bounds for a hereditary property . For ₂ we found two bounds (Theorem 4). An improvement, in some sense, of that in Theorem is given.
Źródło:
Discussiones Mathematicae Graph Theory; 2006, 26, 3; 377-387
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Remarks on the existence of uniquely partitionable planar graphs
Autorzy:
Borowiecki, Mieczysław
Mihók, Peter
Tuza, Zsolt
Voigt, M.
Powiązania:
https://bibliotekanauki.pl/articles/744146.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
property of graphs
additive
hereditary
vertex partition
uniquely partitionable graphs
Opis:
We consider the problem of the existence of uniquely partitionable planar graphs. We survey some recent results and we prove the nonexistence of uniquely (₁,₁)-partitionable planar graphs with respect to the property ₁ "to be a forest".
Źródło:
Discussiones Mathematicae Graph Theory; 1999, 19, 2; 159-166
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Weakly P-saturated graphs
Autorzy:
Borowiecki, Mieczysław
Sidorowicz, Elżbieta
Powiązania:
https://bibliotekanauki.pl/articles/743531.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
graph
extremal problems
hereditary property
weakly saturated graphs
Opis:
For a hereditary property let $k_{}(G)$ denote the number of forbidden subgraphs contained in G. A graph G is said to be weakly -saturated, if G has the property and there is a sequence of edges of G̅, say $e₁,e₂,...,e_l$, such that the chain of graphs $G = G₀ ⊂ G_0 + e₁ ⊂ G₁ + e₂ ⊂ ... ⊂ G_{l-1} + e_l = G_l = K_n(G_{i+1} = G_i + e_{i+1})$ has the following property: $k_{}(G_{i+1}) > k_{}(G_i)$, 0 ≤ i ≤ l-1.
In this paper we shall investigate some properties of weakly saturated graphs. We will find upper bound for the minimum number of edges of weakly ₖ-saturated graphs of order n. We shall determine the number wsat(n,) for some hereditary properties.
Źródło:
Discussiones Mathematicae Graph Theory; 2002, 22, 1; 17-29
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
-bipartitions of minor hereditary properties
Autorzy:
Borowiecki, Piotr
Ivančo, Jaroslav
Powiązania:
https://bibliotekanauki.pl/articles/971979.pdf
Data publikacji:
1997
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
minor hereditary property of graphs
generalized colouring
bipartitions of graphs
Opis:
We prove that for any two minor hereditary properties ₁ and ₂, such that ₂ covers ₁, and for any graph G ∈ ₂ there is a ₁-bipartition of G. Some remarks on minimal reducible bounds are also included.
Źródło:
Discussiones Mathematicae Graph Theory; 1997, 17, 1; 89-93
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 85

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