| |
|
Jarosław Grytczukprofessor
| phone: | (+48-12) 664 69 35 | | fax: | (+48-12) 664 69 13 | | email: |  | | office: | ul. Gronostajowa 3, 30-387 Kraków
| | room: | 106 | | office hours: | Wednesday 14:00 - 16:00 |
| 
|
| research interests |
| graph colorings | | integer sequences | | combinatorial games | | discrete geometry | | probabilistic methods in combinatorics |
| selected publications |
| N. Alon, J. Grytczuk, Breaking the rhythm on graphs, Discrete Math. 308 (2008), 1375-1380. | | T. Bartnicki, J. Grytczuk, A note on the game chromatic index of graphs, Graphs Combin. 24 (2008), 1-4. | | T. Bartnicki, J. Grytczuk, H.A. Kierstead, The game of arboricity, Discrete Math. 308(2008), 1388-1393. | | S. Czerwinski, J. Grytczuk, Nonrepetitive colorings of graphs. 6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Electron. Notes Discrete Math. 28 (2007), 453-459. | | J. Grytczuk, Nonrepetitive colorings of graphs - a survey, Int. J. Math. Math. Sci. 2007, Art. ID 74639, 10 pp. | | T. Bartnicki, J. Grytczuk, H.A. Kierstead, X. Zhu, The map coloring game, Amer. Math. Monthly 114 (2007), no. 9, 793-803. | | B. Bresar, J. Grytczuk, S. Klavzar, S. Niwczyk, I. Peterin, Nonrepetitive colorings of trees, Discrete Math. 307 (2007), no. 2, 163--172. | | J. Grytczuk, Pattern avoidance on graphs, Discrete Math. 307 (2007), no. 11-12, 1341--1346. | | J. Grytczuk, Nonrepetitive graph coloring, Graph Theory, Trends in Mathematics, Birkhauser (2006), 209-218. | | A. Grytczuk, J. Grytczuk, Some results connected with the class number problem in real quadratic fields, Acta Math. Sinica 21 (2005), 1107-1112. | | J. Grytczuk, A. P. Kisielewicz, K. Przesławski, Minimal partitions of a box into boxes. Combinatorica 24 (2004), no. 4, 605--614. | | J. Grytczuk, M. Hałuszczak, H. A. Kierstead, On-line Ramsey Theory, Electron. J. Combin. , 11 (2004), no. 1, Research Paper 60, 10 pp. (electronic). | | J. Grytczuk, Another variation on Conway recursive sequence. Discrete Math. 282 (2004), no. 1-3, 149--161. | | J. Grytczuk, W. Śliwa, Non-repetitive colorings of infinite sets. Discrete Math. 265 (2003), no. 1-3, 365-373. | | M. Borowiecki, J. Grytczuk, M. Hałuszczak, Z. Tuza, Schütte tournament problem and intersecting families of sets. Combin. Probab. Comput. 12 (2003), no. 4, 359--364. | | A. Grytczuk, J. Grytczuk, Ljunggren trinomials and matrix equation A^x+A^y=A^z. Tsukuba J. Math. 26 (2002), no. 2, 229-235. | | J. Grytczuk, Pattern avoiding colorings of Euclidean spaces. Ars Combin. 64 (2002), 109--116. | | J. Grytczuk, Thue-like sequences and rainbow arithmetic progressions. Electron. J. Combin. 9 (2002), no. 1, Research Paper 44, 10 pp. | | N. Alon, J. Grytczuk, M. Hałuszczak, O. Riordan, Nonrepetitive colorings of graphs. Random structures and algorithms (Poznan, 2001). Random Structures Algorithms 21 (2002), no. 3-4, 336-346. | | K. Głazek, J. Grytczuk, J. Skowronek-Kaziów, Remarks on an algebraic realization of closure operators. Contributions to general algebra, 11 (Olomouc/Velké Karlovice, 1998), 85--100, Heyn, Klagenfurt, 1999. | | J. Grytczuk, Intertwined infinite binary words. Discrete Appl. Math. 66 (1996), no. 1, 95--99. | | J. Grytczuk, Infinite self-similar words. Discrete Math. 161 (1996), no. 1-3, 133--141. | | J. Grytczuk, On a result of Shallit and Pethö. Publ. Math. Debrecen 46 (1995), no. 1-2, 11--17. | | J. Grytczuk, On the equation of Fermat with even exponent. C. R. Acad. Sci. Paris Sér. I Math. 314 (1992), no. 5, 325-327. | | J. Grytczuk, Polynomial values of discriminants of linear recurrences. Discuss. Math. 12 (1992), 45-51. | | A. Grytczuk, J. Grytczuk, A remark on the equation of Fermat. C. R. Math. Rep. Acad. Sci. Canada 12 (1990), no. 5, 204--206. | | A. Grytczuk, J. Grytczuk, On first case of Fermat conjecture. Proceedings of the Regional Mathematical Conference (Kalsk, 1988), 33--38, Pedagog. Univ. Zielona Góra, Zielona Góra, 1990. | |
|
|
