2007 |
24 | EE | Denise Amar,
Evelyne Flandrin,
Grzegorz Gancarzewicz,
A. Pawel Wojda:
Bipartite graphs with every matching in a cycle.
Discrete Mathematics 307(11-12): 1525-1537 (2007) |
23 | EE | A. Pawel Wojda,
Mariusz Wozniak,
Irmina A. Ziolo:
On Self-Complementary Cyclic Packing of Forests.
Electr. J. Comb. 14(1): (2007) |
2006 |
22 | EE | Aneta Dudek,
Gyula Y. Katona,
A. Pawel Wojda:
Hamiltonian path saturated graphs with small size.
Discrete Applied Mathematics 154(9): 1372-1379 (2006) |
21 | EE | Jean-Luc Fouquet,
Henri Thuillier,
Jean-Marie Vanherpe,
A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs.
Electronic Notes in Discrete Mathematics 24: 277-284 (2006) |
20 | EE | Beata Orchel,
A. Pawel Wojda:
Some results on placing bipartite graphs of maximum degree two.
Electronic Notes in Discrete Mathematics 24: 285-289 (2006) |
19 | EE | Artur Szymanski,
A. Pawel Wojda:
Self-complementary hypergraphs and their self-complementing permutations.
Electronic Notes in Discrete Mathematics 24: 291-294 (2006) |
2005 |
18 | EE | A. Pawel Wojda,
Mariusz Wozniak,
Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs.
Discrete Mathematics 292(1-3): 167-185 (2005) |
17 | EE | A. Pawel Wojda,
Mariusz Wozniak,
Irmina A. Ziolo:
Erratum to "On self-complementary supergraphs of (n, n)-graphs" [Discrete Math. 292(2005) 167-185].
Discrete Mathematics 301(2-3): 247 (2005) |
2004 |
16 | EE | A. Pawel Wojda:
A condition for a graph to contain k-matching.
Discrete Mathematics 276(1-3): 375-378 (2004) |
2003 |
15 | EE | Aneta Dudek,
Gyula Y. Katona,
A. Pawel Wojda:
m_Path Cover Saturated Graphs.
Electronic Notes in Discrete Mathematics 13: 41-44 (2003) |
2001 |
14 | EE | Rafal Kalinowski,
Antoni Marczyk,
Mariusz Meszka,
A. Pawel Wojda:
Preface.
Discrete Mathematics 236(1-3): 1- (2001) |
2000 |
13 | EE | Grzegorz Gancarzewicz,
A. Pawel Wojda:
Graphs with every k-matching in a Hamiltonian cycle.
Discrete Mathematics 213(1-3): 141-151 (2000) |
12 | EE | A. Pawel Wojda:
A note on the colour class of a self-complementary graph.
Discrete Mathematics 213(1-3): 333-336 (2000) |
11 | EE | A. Pawel Wojda,
Mariusz Wozniak,
Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs.
Electronic Notes in Discrete Mathematics 5: 307-310 (2000) |
1999 |
10 | EE | A. Pawel Wojda:
Erdös-type condition for a graph to contain k independent edges.
Electronic Notes in Discrete Mathematics 3: 214-216 (1999) |
1997 |
9 | EE | A. Pawel Wojda,
Malgorzata Zwonek:
Coloring Edges of Self-complementary Graphs.
Discrete Applied Mathematics 79(1-3): 279-284 (1997) |
8 | EE | Anna Rycerz,
A. Pawel Wojda,
Mariusz Wozniak:
Preface.
Discrete Mathematics 164(1-3): 1-4 (1997) |
7 | EE | A. Pawel Wojda,
Paul Vaderlind:
Packing bipartite graphs.
Discrete Mathematics 164(1-3): 303-311 (1997) |
6 | EE | Günter Schaar,
A. Pawel Wojda:
An upper bound for the Hamiltonicity exponent of finite digraphs.
Discrete Mathematics 164(1-3): 313-316 (1997) |
5 | EE | A. Pawel Wojda,
Irmina A. Ziolo:
Embedding digraphs of small size.
Discrete Mathematics 165-166: 621-638 (1997) |
1993 |
4 | EE | Abdelhamid Benhocine,
A. Pawel Wojda:
Graphs with every matching contained in a cycle.
Discrete Mathematics 118(1-3): 11-21 (1993) |
3 | EE | Jean-Luc Fouquet,
A. Pawel Wojda:
Mutual placement of bipartite graphs.
Discrete Mathematics 121(1-3): 85-92 (1993) |
1987 |
2 | EE | Abdelhamid Benhocine,
A. Pawel Wojda:
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs.
J. Comb. Theory, Ser. B 42(2): 167-180 (1987) |
1986 |
1 | EE | Dominique Sotteau,
A. Pawel Wojda:
Digraphs without directed path of length two or three.
Discrete Mathematics 58(1): 105-108 (1986) |