#### Filter Results:

- Full text PDF available (15)

#### 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

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

- 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 This is an obvious generalization of the graph theoretic concept of an Euler tour. A straightforward necessary condition for existence of an Euler tour in a k-uniform hypergraph is |V odd (H)| (k − 2)|E(H)|, where V odd (H) is the set of vertices of odd degrees in H and E(H) is the set… (More)

- 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 The most important case that we study in this paper concerns equivalence relations defined by graph properties. We write G ≡ Φ H, where Φ is a graph property… (More)

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

- Zbigniew Lonc
- WG
- 1991

- Mekkia Kouider, Zbigniew Lonc
- Combinatorica
- 1996

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

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

- 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 2-and 3-CNF theories, and normal and disjunctive 2-and 3-programs,… (More)

- Mekkia Kouider, Zbigniew Lonc
- Journal of Graph Theory
- 2004