Adam Pawe l Wojda Lista publikacji

1 Adam Pawe l Wojda Lista publikacji Guest editor 1. (with A. Rycerz and M. Woźniak) Discrete Mathematics vol. 164 (1-3) 1997, Elsevier. 2. (with R. Kalinowski, A. Marczyk and M. Meszka) Discrete Mathematics vol. 236 (2001) Elsevier. Prace w recenzowanych czasopismach matematycznych 1. (with Z. Skupień), Sufficient Conditions for k-edge Hamiltonian Graphs, 19, Bull. Acad. Polon. Sci., Sér. Math., Astronom Phys. (1971), 391-395. 2. (with Z. Skupień), On Highly Hamiltonian Graphs, Bull. Acad. Polon. Sci., Sér. Math., Astronom Phys. 22 (1974), 453-471. 3. Sufficient Conditions for a Graph to Be q-connected and q-edge Hamiltonian, Bull. Acad. Polon. Sci., Sér. Math., Astronom Phys., 22 (1974), 229-234. 4. On Hamiltonian Problems, in: Recent Advances in Graph Theory, ed. M. Fiedler, Academia, Prague 1975, 229-232. 5. On Strongly (p,q)-hamiltonian Graphs, Graph Theory Newsletter 5 (1976), 1-3. 6. Hamiltonity of Powers of p-hamiltonian Graphs, in: Graphs, Hypergraphs and Block Systems, ed. M. Borowiecki, Z. Skupień and L. Szamko lowicz, Zielona Góra 1976, 325-332. 7. Strongly (p,q)-hamiltonian Graphs (Some Results), Colloquia Matematica Societas Janos Bolyai, 18 Combinatorics, Kesthely 1976, 1165-1167. 8. On a Class of Hamiltonian-Type Notions, Colloques Internationaux CNRS 260, Orsay 1976, 491-494. 9. (with Z. Skupień), Extremal non (p,q)-hamiltonian Graphs, Stud. Sci. Math. Hung., 10 (1975) 323-328. 10. Meyniel s Theorem for Strongly (p,q)-hamiltonian Digraphs, J. Graph Theory 5 (1981) 333-335.

2 11. (with A. Benhocine), On the Existence of D(n,p) in Digraphs, Annals of Discrete Math. 17 (1983) 47-52. 12. (with A. Benhocine), Problem 2, Annals of Discrete Math. 17 (1983) 665. 13. (with A. Benhocine), On the Existence of a Specified Cycle in a Tournament, J. Graph Theory 7 (1983) 469-473. 14. (with A. Benhocine), Bypasses in Digraphs, Ars Combinatoria 16 (1983) 85-94. 15. (with A. Benhocine), On Self-Complementation, J. Graph Theory 8 (1985) 335-341. 16. (with M. Woźniak), Packing and Extremal Digraphs, ARS Combinatoria, 20B (1985) 71-73. 17. Problem 69, Discrete Math. 57 (1985) 209-210. 18. (with D. Sotteau), Digraphs Without Directed Path of Length Two or Three, Discrete Math. 58 (1986) 105-108. 19. Orientations of Hamiltonian Cycles in Large Digraphs, J. Graph Theory 10 (1986) 211-218. 20. (with A. Benhocine and H.J. Veldman), Packing of Digraphs, Ars Combinatoria 22 (1986) 43-49. 21. (with A. Benhocine), The Geng-Hua Fan Conditions for Pancyclic or Hamiltonian-Connected Graphs, J. Combinatorial Theory Ser. B 42 (1987) 167-180. 22. Hamiltonian Cycles Through Matchings, Demonstratio Mathematica 21 (1988) 547-555. 23. Extremal non Hamiltonian or non Hamiltonian-Connected Digraphs, Ars Combinatoria 25C (1988) 235-240. 24. (with M. Woźniak), Hamiltonian Properties of Balanced Bipartite Digraphs, Hypergraphs and Matroids III, Zielona Góra 1989, Edited by M.Borowiecki and Z.Skupień, 179-186. 25. (with M. Woźniak), Stability Total Vertices and Hamiltonian Cycles, Ars Combinatoria 32 (1991) 345-350. 26. (with M. Woźniak), Orientations of Hamiltonian Cycles in Bipartite Digraphs, Periodica Mathematica Hungarica 28 (2) (1994) 103-108. 27. (with M.Woźniak), Triple Placement of Graphs, Graphs and Combinatorics 9 (1993) 85-91.

3 28. (with A. Benhocine), Graphs with every matching contained in a cycle, Discrete Math. 118 (1993) 11-21. 29. (with JL Fouquet), Mutual Placement of Bipartite Graphs, Discrete Mathematics 121 (1993) 85-92. 30. (with P. Vaderlind), Packing Bipartite Graphs, Discrete Math. 164 (1997) 303-311. 31. (with G. Schaar), Upper bounds for Hamiltonicity exponent of finite digraphs, Discrete Math. 164 (1997) 313-316. 32. (with I. Zio lo), Embedding digraphs of small size, Discrete Math. 165/166 (1997) 621-638. 33. (with M. Zwonek), Coloring edges of self-comlpementary graphs, Discrete Appl. Math. 79 (1997) 279-284. 34. (with G. Gancarzewicz), Graphs with every k-matching in a hamiltonian cycle, Discrete Math. 213 (2000) 141-151. 35. A note on color class of self-complementary graphs, Discrete Math. 213 (2000) 333-336. 36. A condition for a graph to contain a k-matching, Discrete Math. 276 (2004) 375-378. 37. (with A. Dudek), P m -saturated bipartite graphs with minimum size, Discussiones Mathematicae - Graph Theory 24 (2004) 197-211. 38. (with A. Dudek), P m -saturated graphs with minimum size, Opuscula Mathematica 24/1 (2004) 43-55. 39. (with M. Woźniak and I. Zio lo), On self-complementary (n, n) supergraphs, Discrete Math. 292 (2005) 167-185. 40. (with A. Dudek and G. Katona) Hamiltonian path saturated graphs with small size, Discrete Applied Math. 154 (2006) 1372-1379. 41. Self-complementary hypergraphs, Discussiones Mathematicae - Graph Theory 26 (2006) 217-224. 42. (with A. Adamus) Almost symmetric cycles in large digraphs, Graphs and Combinatorics 22 (2006) 443-452. 43. (with D. Amar, E. Flandrin and G. Gancarzewicz), Bipartite graphs with every matching in a cycle, Discrete Math. 307 (2007) 1525-1537. 44. (with M. Woźniak and I. Zio lo) Self complementary cyclic packing of trees, Electronic Journal of Combinatorics 14 (2007) 1-11.

4 45. (with B. Orchel), Long cycles in bipartite balanced graphs, Discussiones Mathematicae - Graph Theory 28 (2008) 535-549. 46. Extremal traceable graphs with non-traceable edges, Opuscula Mathematica 29 (2009) 89-92. 47. (with A. Szymański), A note on k-uniform self-complementary hypergraphs of given order, Discussiones Mathematicae - Graph Theory 29 (2009) 199-202. 48. (with A. Szymański) Self-complementing permutations of k-uniform hypergraphs, Discrete Mathematics and Theoretical Computer Science 11 (2009) 117-124. 49. (with J.-L. Fouquet, H. Thuillier, J.-M. Vanherpe), On isomorphic linear partitions in cubic graphs, Discrete Math. 309 (2009) 6425-6433. 50. (with J.-L. Fouquet, H. Thuillier, J.-M. Vanherpe) On odd and semiodd linear partitions of cubic graphs, Discussiones Mathematicae - Graph Theory 29 (2009) 275-292. 51. (with l. Adamus, B. Orchel, A. Szymański and M. Zwonek) A note on t-complementing permutations for graphs, Information Processing Letters 10 (2009) 44-45. 52. (with A. Szymański) Cyclic partitions of complete uniform hypergraphs, Electron. J. Comb. 17 (2010) #R118, 1-12. 53. Preface, Discussiones Mathematicae Graph Theory 30 (2010) 275-276.

5 Prace opublikowane w czasopismach niematematycznych (lub nierecenzowane) 1. (with W. Pietraszewski), Metoda optymalizacji sieci powiazań dla realizacji zespo lów urbanistycznych, Sprawozdania z Posiedzeń Komisji Nauk Oddz. PAN w Krakowie, XIV (1) 1970, 405-407. 2. Przyk lad zastosowań metod urbanistycznych w programowaniu architektoniczno - urbanistycznym, Sprawozdania z Posiedzeń Komisji Nauk Oddz. PAN w Krakowie, XIV (1) 1970, 398-400. 3. (with A. Wojda), Mathematiques et architecture, Neuf 26, Bruxelles 1970, 23-33. 4. (with W. Pietraszewski and S. Podolak), Optymalizacja rozmieszczenia przemys lu w aglomeracjach miejskich, Materia ly z Sympozjum Krajów Cz lonków RWPG: Informatyka w Przemyśle Budowlanym, Kraków 1970. 5. (with W. Pietraszewski, S.Podolak, J. Kudela) Optymalizacja rozmieszczenia przemys lu w planach ogólnych miast, Przegl ad Budowlany 7-8 (1970), 349-352. 6. (with W. Niedoba and Z. Skupień), Minimalizacja Zamrożenia w procesie inwestycyjnym, Przegl ad Statystyczny R XXV (1) 1978, (65-73). 7. Extremal digraphs without directedm paths of degree thre or two, Memorandum 449, THT, Enschede 1984. 8. (with S. Jasienska, A. Lȩdzki, St. Rychlicki, K. Liszka), Niektóre aspekty organizacji kszta lcenia w wyższych uczelniach Francji, in: Wybrane zagraniczne systemy studiów - Sympozjum, ed. J. Jachimski, Kraków 1993, 95-108. 9. (with Z. Skupień), Matematyka dyskretna w Instytucie Matematyki AGH, in: Matematyka w 75-Leciu Akademii Górniczo-Hutniczej i 25-Leciu Instytutu Matematyki AGH, ed. St. Bia las, Z. Pawlikowska-Broźek, D. W eglowska i A.P. Wojda, Kraków 1995, 111-121. 10. (with M. Zwonek), Color index of self-complementary graphs, in: 4th Twente Workshop on Graphs and Combinatorial Optimization, ed. U. Feigle and C. Hoede, Enschede 7-9 June 1995, 243-245. 11. (with B. Orchel), Bi-placement of bipartite graphs of small size (extended abstract). in: Scientific Programm, 5th Twente Workshop on Graphs and Combinatorial Optimization 20-22 May 1997, U. Feigle and C. Hoede (eds.) 218-222. 12. On a problem for graphs without triangles, Research Reports in Mathematics 4 (1999) Department of Mathematics, Stockholm University.

6 13. (with A. Dudek and G. Katona) m Path Cover Saturated Graphs (Extended abstract), in: Scientific Programm, 2nd Cologne-Twente Workshop 2003, H. Broersma, U. Feigle, J. Hurink, S. Pickl and G. Woeginger, Enschede 2003. 14. (with J.-L. Fouquet, H. Thuillier and J.-M. Vanherpe) On isomprphic linear partitions in cubic graphs - SHORT COMMUNICATION, Electronic Notes in Discrete Mathematics 24 (2006) 277-284. 15. (with B. Orchel) Some results on placing bipartite graphs of maximum degree two - SHORT COMMUNICATION, Electronic Notes in Discrete Mathematics 24 (2006) 285-289. 16. (with A. Szymański) Self-complementary hypergraphs and their self-complementing permutations - SHORT COMMUNICATION, Electronic Notes in Discrete Mathematics 24 (2006) 291-294.