#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1981

2017

- This year (3)
- Last 5 years (13)
- Last 10 years (21)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mekkia Kouider, Zbigniew Lonc
- Australasian J. Combinatorics
- 1999

We consider edge-decompositions of regular graphs into isomorphic paths. An m-PPD (perfect path decomposition) is a decomposition of a graph into paths of length m such that every vertex is an end of exactly two paths. An m-PPDC (perfect path double cover) is a covering of the edges by paths of length m such that every edge is covered exactly two times and… (More)

- Jerzy W. Jaromczyk, Zbigniew Lonc
- ISAAC
- 2004

- Zbigniew Lonc
- WG
- 1991

- Zbigniew Lonc, Pawel Naroski
- Electr. J. Comb.
- 2010

Let H be a k-uniform hypergraph, k > 2. By an Euler tour in H we mean an alternating sequence v0, e1, v1, e2, v2, . . . , vm−1, em, vm = v0 of vertices and edges in H such that each edge of H appears in this sequence exactly once and vi−1, vi ∈ ei, vi−1 6= vi, for every i = 1, 2, . . . ,m. This is an obvious generalization of the graph theoretic concept of… (More)

- Mekkia Kouider, Zbigniew Lonc
- Combinatorica
- 1996

- Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski
- Networks
- 2001

- Zbigniew Lonc
- Discrete Applied Mathematics
- 1996

- Zbigniew Lonc, Miroslaw Truszczynski
- Discrete Mathematics
- 2011

Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalence relation ≡s such that G ≡s H , where G,H ∈ G, if for every F ∈ G, G ∪ F ≡ H ∪ F . The most important case that we study in this paper concerns equivalence relations defined by graph… (More)

- Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski
- J. Comb. Theory, Ser. A
- 2012

- Zbigniew Lonc, Miroslaw Truszczynski
- TPLP
- 2003

We propose and study algorithms to compute minimal models, stable models and answer sets of t-CNF theories, and normal and disjunctive t-programs. We are especially interested in algorithms with non-trivial worst-case performance bounds. The bulk of the paper is concerned with the classes of 2and 3-CNF theories, and normal and disjunctive 2and 3-programs,… (More)