| 2008 |
|---|
| 37 | EE | Ervin Györi,
Mirko Hornák,
Cory Palmer,
Mariusz Wozniak:
General neighbour-distinguishing index of a graph.
Discrete Mathematics 308(5-6): 827-831 (2008) |
| 36 | EE | Mirko Hornák,
Mariusz Wozniak:
On arbitrarily vertex decomposable trees.
Discrete Mathematics 308(7): 1268-1281 (2008) |
| 2007 |
|---|
| 35 | EE | Mirko Hornák,
Zsolt Tuza,
Mariusz Wozniak:
On-line arbitrarily vertex decomposable trees.
Discrete Applied Mathematics 155(11): 1420-1429 (2007) |
| 34 | EE | Agnieszka Görlich,
Monika Pilsniak,
Mariusz Wozniak,
Irmina A. Ziolo:
Fixed-point-free embeddings of digraphs with small size.
Discrete Mathematics 307(11-12): 1332-1340 (2007) |
| 33 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A Chvátal-Erdos type condition for pancyclability.
Discrete Mathematics 307(11-12): 1463-1466 (2007) |
| 32 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs.
Discrete Mathematics 307(7-8): 878-884 (2007) |
| 31 | EE | Agnieszka Görlich,
Rafal Kalinowski,
Mariusz Meszka,
Monika Pilsniak,
Mariusz Wozniak:
A note on decompositions of transitive tournaments.
Discrete Mathematics 307(7-8): 896-904 (2007) |
| 30 | EE | A. Pawel Wojda,
Mariusz Wozniak,
Irmina A. Ziolo:
On Self-Complementary Cyclic Packing of Forests.
Electr. J. Comb. 14(1): (2007) |
| 2006 |
|---|
| 29 | EE | Mirko Hornák,
Mariusz Wozniak:
On neighbour-distinguishing colourings from lists.
Electronic Notes in Discrete Mathematics 24: 295-297 (2006) |
| 28 | EE | Agnieszka Görlich,
Monika Pilsniak,
Mariusz Wozniak:
A Note on a Packing Problem in Transitive Tournaments.
Graphs and Combinatorics 22(2): 233-239 (2006) |
| 27 | EE | Keith Edwards,
Mirko Hornák,
Mariusz Wozniak:
On the Neighbour-Distinguishing Index of a Graph.
Graphs and Combinatorics 22(3): 341-350 (2006) |
| 2005 |
|---|
| 26 | 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) |
| 25 | 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) |
| 24 | EE | Rafal Kalinowski,
Monika Pilsniak,
Mariusz Wozniak,
Irmina A. Ziolo:
Some families of arbitrarily vertex decomposable graphs.
Electronic Notes in Discrete Mathematics 22: 451-454 (2005) |
| 23 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A Note on a Generalisation of Ore's Condition.
Graphs and Combinatorics 21(2): 213-216 (2005) |
| 2004 |
|---|
| 22 | EE | Mariusz Wozniak:
Packing of graphs and permutations--a survey.
Discrete Mathematics 276(1-3): 379-391 (2004) |
| 21 | EE | Evelyne Flandrin,
Hao Li,
Antoni Marczyk,
Mariusz Wozniak:
A note on pancyclism of highly connected graphs.
Discrete Mathematics 286(1-2): 57-60 (2004) |
| 20 | EE | Agnieszka Görlich,
Monika Pilsniak,
Mariusz Wozniak,
Irmina A. Ziolo:
A note on embedding graphs without short cycles.
Discrete Mathematics 286(1-2): 75-77 (2004) |
| 19 | EE | Mirko Hornák,
Stefan Pcola,
Mariusz Wozniak:
On the Achromatic Index of for a Prime q.
Graphs and Combinatorics 20(2): 191-203 (2004) |
| 18 | EE | Stephan Brandt,
Mariusz Wozniak:
On Cyclic Packing of a Tree.
Graphs and Combinatorics 20(4): 435-442 (2004) |
| 2003 |
|---|
| 17 | EE | Antoni Marczyk,
Mariusz Wozniak:
Cycles in hamiltonian graphs of prescribed maximum degree.
Discrete Mathematics 266(1-3): 321-326 (2003) |
| 2002 |
|---|
| 16 | EE | Mariusz Wozniak:
On cyclically embeddable (n, n-1)-graphs.
Discrete Mathematics 251(1-3): 173-179 (2002) |
| 2001 |
|---|
| 15 | EE | Mariusz Wozniak:
Note on compact packing of a graph.
Discrete Mathematics 233(1-3): 205-210 (2001) |
| 14 | EE | Hamamache Kheddouci,
Susan Marshall,
Jean-François Saclé,
Mariusz Wozniak:
On the packing of three graphs.
Discrete Mathematics 236(1-3): 197-225 (2001) |
| 13 | EE | Cristina Bazgan,
Amel Harkat-Benhamdine,
Hao Li,
Mariusz Wozniak:
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree.
Discrete Mathematics 236(1-3): 37-42 (2001) |
| 12 | EE | Cristina Bazgan,
Amel Harkat-Benhamdine,
Hao Li,
Mariusz Wozniak:
Partitioning vertices of 1-tough graphs into paths.
Theor. Comput. Sci. 263(1-2): 255-261 (2001) |
| 2000 |
|---|
| 11 | EE | Hamamache Kheddouci,
Jean-François Saclé,
Mariusz Wozniak:
Packing two copies of a tree into its fourth power.
Discrete Mathematics 213(1-3): 169-178 (2000) |
| 10 | 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) |
| 9 | EE | Mariusz Wozniak:
Packing of graphs and permutations.
Electronic Notes in Discrete Mathematics 5: 311-314 (2000) |
| 1999 |
|---|
| 8 | EE | Cristina Bazgan,
Amel Harkat-Benhamdine,
Hao Li,
Mariusz Wozniak:
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs.
J. Comb. Theory, Ser. B 75(2): 288-301 (1999) |
| 1997 |
|---|
| 7 | EE | Anna Rycerz,
A. Pawel Wojda,
Mariusz Wozniak:
Preface.
Discrete Mathematics 164(1-3): 1-4 (1997) |
| 6 | EE | Jean-François Saclé,
Mariusz Wozniak:
A note on packing of three forests.
Discrete Mathematics 164(1-3): 265-274 (1997) |
| 5 | EE | Jean-François Saclé,
Mariusz Wozniak:
On graphs which contain each tree of given size.
Discrete Mathematics 165-166: 599-605 (1997) |
| 4 | EE | Jean-François Saclé,
Mariusz Wozniak:
The Erdös-Sós Conjecture for Graphs withoutC4.
J. Comb. Theory, Ser. B 70(2): 367-372 (1997) |
| 1996 |
|---|
| 3 | EE | Maryvonne Mahéo,
Jean-François Saclé,
Mariusz Wozniak:
Edge-disjoint Placement of Three Trees.
Eur. J. Comb. 17(6): 543-563 (1996) |
| 1994 |
|---|
| 2 | EE | Mariusz Wozniak:
Embedding Graphs of Small Size.
Discrete Applied Mathematics 51(1-2): 233-241 (1994) |
| 1993 |
|---|
| 1 | EE | Mariusz Wozniak:
A note on minimal order of a bipartite graph with exactly q quadrilaterals.
Discrete Mathematics 121(1-3): 229-233 (1993) |
