Publikacje

Czasopismo: Discrete Mathematics And Theoretical Computer Science

Liczba publikacji: 2

2013

• Marek Adam Cygan, Marcin Łukasz Pilipczuk i Riste Skrekovski, A bound on the number of perfect matchings in Klee-graphs, Discrete Mathematics And Theoretical Computer Science 15 (1) 2013, s. 37–54.zobacz w PBN

2010

• Łukasz Kowalik, Borut Luzar i Riste Skrekovski, An improved bound on the largest induced forests for triangle-free planar graphs, Discrete Mathematics And Theoretical Computer Science 12 (1) 2010, s. 87–100.zobacz w PBN