Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Lech Adamus
2010 – today
- 2012
[j6]Janusz Adamus, Lech Adamus: A degree condition for cycles of maximum length in bipartite digraphs. Discrete Mathematics 312(6): 1117-1122 (2012)
2000 – 2009
- 2009
[j5]Lech Adamus: Edge condition for long cycles in bipartite graphs. Discrete Mathematics & Theoretical Computer Science 11(2): 25-32 (2009)
[j4]Janusz Adamus, Lech Adamus: Ore and Erdős type conditions for long cycles in balanced bipartite graphs. Discrete Mathematics & Theoretical Computer Science 11(2): 57-70 (2009)
[j3]Lech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek: A note on t-complementing permutations for graphs. Inf. Process. Lett. 110(2): 44-45 (2009)- 2006
[j2]Lech Adamus: Long cycles in graphs and digraphs. Electronic Notes in Discrete Mathematics 24: 3-7 (2006)
[j1]Lech Adamus, A. Pawel Wojda: Almost Symmetric Cycles in Large Digraphs. Graphs and Combinatorics 22(4): 443-452 (2006)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:27 CET by the dblp team



