Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

Znaleziono wyników: 8

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Przeciwciała - narzędzie przyrody i człowieka

100%

Gorlich A.

Wszechświat

2016

tom 117

nr 04-06

Planar packing of cycles and unicyclic graphs

100%

Gorlich A.

Demonstratio Mathematica

2009

tom Vol. 42, nr 4

673-679

We say that a graph G is packable into a complete graph Kn if there are two edge-disjoint subgraphs of Kn both isomorphic to G. It is equivalent to the existence of a permutation a of a vertex set in G such that if an edge xy belongs to E(G), then a(x)cr(y) does not belong to E(G). In 2002 Garcia et al. have shown that a non-star tree T is planary packable into a complete graph Kn. In this paper we show that for any packable cycle Cn except of the case n = 5 and n=7 there exists a planar packing into Kn. We also generalize this result to certain classes of unicyclic graphs.

Na początku było "white"

63%

Gorlich A. , Gorska-Andrzejak J.

Wszechświat

2013

tom 114

nr 04-06

Open trails in digraphs

63%

Cichacz S. , Gorlich A.

Opuscula Mathematica

2011

tom Vol. 31, no. 4

599-604

It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph Ka,b, is decomposable into open trails of prescribed even lengths. In this article we consider the corresponding question for directed graphs. We show that the complete directed graphs ↔K n and ↔K a,b are arbitrarily decomposable into directed open trails.

Anti-Ramsey numbers for disjoint copies of graphs

63%

Gorgol I. , Gorlich A.

Opuscula Mathematica

2017

tom Vol. 37, no. 4

567--575

A subgraph of an edge-colored graph is called rainbow if all of its edges have different colors. For a graph G and a positive integer n, the anti-Ramsey number ar(n,G) is the maximum number of colors in an edge-coloring of Kn with no rainbow copy of H. Anti-Ramsey numbers were introduced by Erdos, Simonovits and Sós and studied in numerous papers. Let G be a graph with anti-Ramsey number ar(n, G). In this paper we show the lower bound for ar(n,pG), where pG denotes p vertex-disjoint copies of G. Moreover, we prove that in some special cases this bound is sharp.

Bialka opiekuncze - szare eminencje w komorce

50%

Gorlich A.

Wszechświat

2006

tom 107

nr 07-09

200-205

Cyclie expression of the alpha subunit of the Na/K- ATPase in the brain of Drosophila melanogaster

45%

Gorska-Andrzejak J. , Wszolek A. , Gorlich A. , Semik D. , Pyza E.

Acta Neurobiologiae Experimentalis

2005

tom 65

nr 3

Antiserum against connexin32 fragment reacts with a 32-kD protein localised in gap junctions of mouse and rat liver, endometrium and in the fish heart

44%

Kilarski W. M. , Witczuk B. , Kupryszewski G. , Semik D. , Gorlich A.

Folia Histochemica et Cytobiologica

1998

tom 36

nr 3