Search the dblp DataBase

Publications of Author

1. A. Pawel Wojda, Malgorzata Zwonek
   Coloring Edges of Self-complementary Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:279-284 [Journal]
   
2. Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
   Hamiltonian path saturated graphs with small size. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:9, pp:1372-1379 [Journal]
   
3. Grzegorz Gancarzewicz, A. Pawel Wojda
   Graphs with every k-matching in a Hamiltonian cycle. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:141-151 [Journal]
   
4. Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:236, n:1-3, pp:1-0 [Journal]
   
5. A. Pawel Wojda
   A note on the colour class of a self-complementary graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2000, v:213, n:1-3, pp:333-336 [Journal]
   
6. A. Pawel Wojda
   A condition for a graph to contain k-matching. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:276, n:1-3, pp:375-378 [Journal]
   
7. A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
   On self-complementary supergraphs of (n, n)-graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:292, n:1-3, pp:167-185 [Journal]
   
8. A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
   Erratum to "On self-complementary supergraphs of (n, n)-graphs" [Discrete Math. 292(2005) 167-185]. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2005, v:301, n:2-3, pp:247- [Journal]
   
9. Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda
   Bipartite graphs with every matching in a cycle. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:11-12, pp:1525-1537 [Journal]
   
10. Abdelhamid Benhocine, A. Pawel Wojda
    The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:2, pp:167-180 [Journal]
    
11. Dominique Sotteau, A. Pawel Wojda
    Digraphs without directed path of length two or three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:105-108 [Journal]
    
12. Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:1-4 [Journal]
    
13. Günter Schaar, A. Pawel Wojda
    An upper bound for the Hamiltonicity exponent of finite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:313-316 [Journal]
    
14. A. Pawel Wojda, Paul Vaderlind
    Packing bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:303-311 [Journal]
    
15. A. Pawel Wojda, Irmina A. Ziolo
    Embedding digraphs of small size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:621-638 [Journal]
    
16. Abdelhamid Benhocine, A. Pawel Wojda
    Graphs with every matching contained in a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:11-21 [Journal]
    
17. Jean-Luc Fouquet, A. Pawel Wojda
    Mutual placement of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:85-92 [Journal]
    
18. 
    On Self-Complementary Cyclic Packing of Forests. [Citation Graph (, )][DBLP]
    
    
19. 
    On isomorphic linear partitions in cubic graphs. [Citation Graph (, )][DBLP]