On the vertex-distinguishing proper edge-colorings of graphs C Bazgan, A Harkat-Benhamdine, H Li, M Wo¼niak Journal of Combinatorial Theory, Series B 75 (2), 288-301, 1999 | 332 | 1999 |
On a 1, 2 conjecture J Przyby³o, M Wo¼niak Discrete Mathematics and Theoretical Computer Science 12 (1), 101-108, 2010 | 87 | 2010 |
The Erdõs–Sós Conjecture for Graphs withoutC4 JF Saclé, M Wo¼niak Journal of Combinatorial Theory, Series B 70 (2), 367-372, 1997 | 80 | 1997 |
Neighbor sum distinguishing index E Flandrin, A Marczyk, J Przyby³o, JF Saclé, M Wo¼niak Graphs and Combinatorics 29, 1329-1336, 2013 | 79 | 2013 |
On the Erdös‐Sós conjecture M Wo¼niak Journal of Graph Theory 21 (2), 229-234, 1996 | 78 | 1996 |
On the neighbour-distinguishing index of a graph K Edwards, M Horòák, M Wo¼niak Graphs and combinatorics 22 (3), 341-350, 2006 | 75 | 2006 |
On the total-neighbor-distinguishing index by sums M Pil¶niak, M Wo¼niak Graphs and Combinatorics 31 (3), 771-782, 2015 | 72 | 2015 |
On decomposing regular graphs into locally irregular subgraphs O Baudon, J Bensmail, J Przyby³o, M Wo¼niak European Journal of Combinatorics 49, 90-104, 2015 | 65 | 2015 |
General neighbour-distinguishing index of a graph E Gyõri, M Horòák, C Palmer, M Wo¼niak Discrete Mathematics 308 (5-6), 827-831, 2008 | 65 | 2008 |
Total weight choosability of graphs. J Przyby³o, M Wo¼niak The Electronic Journal of Combinatorics [electronic only] 18 (1), Research …, 2011 | 49 | 2011 |
Packing of graphs and permutations—a survey M Wo¼niak Discrete mathematics 276 (1-3), 379-391, 2004 | 44 | 2004 |
Arbitrarily vertex decomposable trees are of maximum degree at most six M Hornák, M Wo¼niak Opuscula Mathematica 23, 49-62, 2003 | 43 | 2003 |
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree C Bazgan, A Harkat-Benhamdine, H Li, M Wo¼niak Discrete mathematics 236 (1-3), 37-42, 2001 | 35 | 2001 |
On-line arbitrarily vertex decomposable trees M Horòák, Z Tuza, M Wo¼niak Discrete Applied Mathematics 155 (11), 1420-1429, 2007 | 31 | 2007 |
On the Loebl–Komlós–Sós conjecture C Bazgan, H Li, M Wo¼niak Journal of Graph Theory 34 (4), 269-276, 2000 | 30 | 2000 |
Minimum number of palettes in edge colorings M Horòák, R Kalinowski, M Meszka, M Wo¼niak Graphs and Combinatorics 30 (3), 619-626, 2014 | 29 | 2014 |
On a 1, 2 conjecture J Przybylo, M Wo¼niaK Discrete Mathematics & Theoretical Computer Science 12 (Graph and Algorithms), 2010 | 27 | 2010 |
Decomposition of complete bipartite even graphs into closed trails M Horòák, M Wo¼niak Czechoslovak Mathematical Journal 53 (1), 127-134, 2003 | 27 | 2003 |
On arbitrarily vertex decomposable trees M Horòák, M Wo¼niak Discrete mathematics 308 (7), 1268-1281, 2008 | 25 | 2008 |
Packing two copies of a tree into its fourth power H Kheddouci, JF Saclé, M Wo¼niak Discrete Mathematics 213 (1-3), 169-178, 2000 | 25 | 2000 |