#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1998

2018

- This year (0)
- Last 5 years (11)
- Last 10 years (28)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Janusz Adamus, Lech Adamus
- Discrete Mathematics
- 2012

We prove a sharp Ore-type criterion for hamiltonicity of balanced bipartite digraphs: for a>=2, a bipartite digraph D with colour classes of cardinalities a is hamiltonian if d^+(u)+d^-(v)>=a+2… (More)

- Janusz Adamus, Lech Adamus, Anders Yeo
- Discrete Mathematics & Theoretical Computer…
- 2012

We prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digraph: For k greater than or equal to 2, a bipartite digraph D with colour classes of cardinalities k is… (More)

- Janusz Adamus
- 2009

A well-known theorem of Entringer and Schmeichel asserts that a balanced bipartite graph of order \(2n\) obtained from the complete balanced bipartite \(K_{n,n}\) by removing at most \(n-2\) edges,… (More)

We prove that, if F is a coherent sheaf of OX-modules over a morphism ' : X → Y of complex-analytic spaces, where Y is smooth, then the stalk Fat a point � ∈ X is flat over R := OY,'(�) if and only… (More)

- Janusz Adamus
- 2004

We study the relationship between degeneracies of the family of fibres of an analytic mapping and the existence of vertical components in fibre powers of the mapping. Our main result is the following… (More)

- Janusz Adamus
- Graphs and Combinatorics
- 2015

We prove that a strongly connected balanced bipartite digraph D of order 2a is hamiltonian, provided $$a\ge 3$$a≥3 and $$d(x)+d(y)\ge 3a$$d(x)+d(y)≥3a for every pair of vertices x, y with a common… (More)

Given a semianalytic set S in $${\mathbb{C}^n}$$ and a point $${p \in \bar{S}}$$, there is a unique smallest complex-analytic germ Xp which contains Sp, called the holomorphic closure of Sp. We show… (More)

- Janusz Adamus
- 2009

It is shown that a hamiltonian n/2-regular bipartite graph G of order 2n > 8 contains a cycle of length 2n 2. Moreover, if such a cycle can be chosen to omit a pair of adjacent vertices, then G is… (More)

- Janusz Adamus
- 2007

We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is… (More)

- Janusz Adamus
- Graphs and Combinatorics
- 2017

We prove that a strongly connected balanced bipartite digraph D of order 2a, $$a\ge 3$$a≥3, satisfying $$d(u)+d(v)\ge 3a$$d(u)+d(v)≥3a for every pair of vertices u, v with a common in-neighbour or a… (More)