Jednostki i pracownicy - książka adresowa

dr hab. Halina Bielak

Stanowisko
profesor uczelni
Jednostki
KATEDRA MATEMATYKI STOSOWANEJ
Adres e-mail
Wyświetl
Konsultacje

wtorek :  10:00-12:00, p.239 IM

Działalność naukowa

List of publications

Published before doctoral degree
1. H.Bielak, M.M.Sysło, Peripheral vertices in graphs, Studia Scientarum Math. Hungar. vol.18 (1983) 269—275.
2. H.Bielak, On graphs with non isomorphic 2-neighbourhoods, Čas. pěst. Mát. 108 (1983) 294—298, (obecnie Mathematica Bohemica).
3. H.Bielak, E.Soczewińska, Some remarks about digraphs with non-isomorphic 1- or 2- neighbourhoods, Čas. pěst. Mát. 108 (1983) 299—304, (obecnie Mathematica Bohemica).
4. H.Bielak, On j-neighbourhoods in simple graphs, Graphs and other Combinatorial Topics (M. Fiedler, ed.), (Praha,1982), Liepzig, 1983, 7—11.
5. H.Bielak, E. Soczewińska, On j-neighbourhoods in digraphs, Graphs and other Combinatorial Topics (M. Fiedler, ed.), Liepzig, 1983, 12—16 .
6. H.Bielak, Central and peripheral vertices in digraphs, Algebra, Combinatorics and Logic in Computer Science (J.Demetrovics, G.Katona, A.Salomea, eds.), Coll. Math. Soc. J.Bolyai, vol. 42, North-Holland, Amsterdam, 1985, 125—131.
7. H.Bielak, E.Soczewińska, On j-neighbourhoods in digraphs I, Algebra,Combinatorics and Logic in Computer Science (J.Demetrovics, G.Katona, A.Salomea, eds.), Coll. Math. Soc. J.Bolyai, vol. 42, North- Holland, Amsterdam, 1985, 133—140 .
8. H.Bielak, Minimal realizations of graphs as central subgraphs, Graphs Hypergraphs and Matroids. Section: Graph Theory (M.Borowiecki, Z.Skupień, eds.), Zielona Góra, 1985, 13—24.
 Published before habilitation/ after doctoral degree
9. H.Bielak, Some remarks about medians in graphs, Graphs Hypergraphs and Matroids. Section: Graph Theory (M.Borowiecki, Z.Skupień, eds.), Zielona Góra, 1987, 7—15.
10. H.Bielak, Remarks on the size Ramsey number of graphs, Period. Math. Hungar. vol. 18(1) (1987) 27—38.
11. Bielak, On graphs with restricted link graphs and chromatic number at most 3, Čas. pěst. Mát. 113 (1988) 351—357, (obecnie Mathematica Bohemica).
12. H.Bielak, Remarks on graphs with homogeneous 1-, and 2-links, Proc. 33. IWK, Graphen und Netzwerke-Theorie und Anwendungen, TH Ilmenau,1988, 155—157.
13. H.Bielak, Generalized neighbourhoods and perfectly orderable graphs, Graphs, Hypergraphs and Matroids. Section: Graph Theory (M.Borowiecki, Z.Skupień, eds.), Zielona Góra, 1989, 7—16.
14. H.Bielak, Graphs with special neighbourhood orderings of vertices, Discrete Math. 121 (1993) 3—9.
15. H.Bielak, I. Gorgol, On Size Ramsey Numbers for Certain Hypergraphs, Discuss. Math. 13 (1993) 5—14.
16. H.Bielak, Chromatic uniqueness in a family of 2-connected graphs, Discrete Math. 164(1997) 21—28.
17. H.Bielak, Zastosowania wielomianów chromatycznych i ich uogólnień do analizy niezawodności sieci, Informatyka Stosowana, II LAFI 98, Kazimierz Dln., maj 1998, 1—8.
18. H.Bielak, Equivalent classes for K3-gluings of wheels, Discuss. Math. Graph Theory 18(1998) 73—84.
19. H.Bielak, The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six, Discuss. Math.Graph Theory 18(1998) 99—111.
20. H.Bielak, A Note on the Ramsey Number and the Planar Ramsey Number for C4 and Complete Graphs, Discuss. Math. Graph Theory 19(1999) 135—142.
21. H.Bielak, Sufficient Conditions for Hamiltonicity of N2-Locally Connected Claw-Free Graphs, Discrete Math. 213 / 1—3 (2000) 21—24.
22. H.Bielak, I. Gorgol, The Planar Ramsey Numbers for C4
and is 13, Discrete Math. 236 / 1—3 (2001) 43—51.
23. H. Bielak, Roots of chromatic polynomials, Discrete Math. 231 / 1—3(2001) 97—102.
24. H. Bielak, Local Ramsey Numbers for Some Graphs, Discrete Math. 266 / 1—3 (2003) 87—99.
25. H.Bielak, The Local Ramsey Numbers for Copies of Cycles, Discrete Math. 276 (2004) 29—42.
26. H.Bielak, Grafy planarne: stabilność i cykliczność, Algorytmy, metody i programy naukowe, (S. Grzegórski, Miłosz, P. Muryjas, red.), Lublin 2004, 57—63.
27. H.Bielak, Local Ramsey Numbers for Linear Forests, Annales UMCS Sect. A 59 (2005) 1—7.
28. H.Bielak, A new method for counting chromatic coefficients, Annales UMCS Sect. AI 3 (2005) 179—189.
29. H.Bielak, Chromatic properties of Hamiltonian Graphs, Discrete Math. 307 / 11—12 (2007) 1245—1254.
30. H.Bielak, Relations between 2-Local and 2-Mean Ramsey Numbers for Graphs, Discrete Math. 307 / 7—8 (2007) 827—831.
31. H.Bielak, Ramsey and 2-Local Ramsey Numbers for Disjoint Unions of Cycles, Discrete Math. 307 / 3—5 (2007) 319—330.
32. H. Bielak, The oriented chromatic number of some grids, Ann. UMCS Sect. AI 5 (2006), 5—17.

 Published after habilitation

33. H. Bielak, Size Ramsey numbers for some regular graphs, Discrete Math. 309 (2009) 6446—6449.
34. H. Bielak, Ramsey numbers for a disjoint union of some graphs, Applied Math. Letters, 22 (2009) 475—477.
35. H. Bielak, Multicolor Ramsey numbers for some paths and cycles, Discussiones Mathematicae – Graph Theory 29 (2009) 209—218.
36. H. Bielak, Ramsey numbers for a disjoint union of good graphs, Discrete Math. 310 (2010) 1501—1505.
37. H. Bielak, M. Pańczyk, Self-stabilizing algorithm for finding weighted centroid in trees, Annales UMCS Sect. AI 2 (2012) 27—37.
38. H. Bielak, M. Pańczyk, A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given, Annales UMCS Sect. AI 1 (2013) 1—10.
39. H. Bielak, M. Pańczyk, A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given, Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 293—297; IEEE Catalog Number: CFP1385N-ART (WEB), CFP1385N-USB(USB); ISBN 978-1-4673-4471-5 (WEB).
40. H.Bielak, S. Kieliszek, The Turán number of the graph 3P4, Annales UMCS Sect. A 68 (1)( 2014) 21—29.
41. H. Bielak, M. Pańczyk, Self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs, Annals of Computer Science and Information Systems, vol. 3, Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 93—99.
42. H. Bielak, K. Powroźnik, An efficcient algorithm for the density Turán problem of some unicyclic graphs, Annals of Computer Science and Information Systems, vol. 2, Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 479— 486; IEEE Catalog Number: CFP1485N-ART (WEB), CFP1485N-USB(USB); ISBN 978-83-60810-61-3 (ART); ISBN 978-83-60810-58-3 (WEB); ISSN2300-5963; DOI 10.15439/978-83-60810-58-3.
43. H. Bielak, K. Wolska, On the adjacent eccentric distance sum of graphs, Annales UMCS Sect. A vol. 68(2) (2014) 1—10.
44. M. Pańczyk, H. Bielak, A self-stabilizing algorithm for locating the center of maximal outerplanar graphs, J. Universal Computer Science, vol. 20, no.14 (2014) 1951—1963.
45. H. Bielak, K. Powroźnik, Statuses and double branch weights of qudrangular outerplanar graphs, Annales UMCS Sect. A 69(1)(2015) 5—21.
46. B. Li, Y. Zhang, H. Bielak, H. Broersma, P. Holub, Closing the gap on path-kipas Ramsey numbers, Electr. J. Combin. 22 (3) (2015), #P3.21 .
47. H. Bielak, K. Powroźnik, The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs. An efficcient testing algorithm, Annals of Computer Science and Information Systems, vol. 5(2015) 563--571, Proceedings of the 2015 Federated Conference on Computer Science and Information Systems.
48. H. Bielak, K. Dąbrowska, K. Wolska, On the generalized Wiener polarity index for some classes of graphs, , Annals of Computer Science and Information Systems, vol. 5(2015) 483--487, Proceedings of the 2015 Federated Conference on Computer Science and Information Systems.
49. H. Bielak, K. Dąbrowska, The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths, Annales UMCS Sect. A 69 (2) (2015)1—7.

50. H.Bielak, S. Kieliszek, The Turán number of the graph 2P5, Discuss. Math.Graph Theory 36(2016) 683—694.
51. B. Li, H. Bielak, On the Ramsey-goodness of paths, Graphs Combin. 32 (2016) 2541—2549.
52. H. Bielak, K. Broniszewska, Eccentric distance sum index for some classes of connected graphs, Annales UMCS Sect. A vol. 71(2) (2017) 25—32.
53. H. Bielak, K. Powroźnik, The density Turán problem for 3-uniform linear hipertrees . An efficient testing algorithm, Annales UMCS Sect. A vol. 72(2) (2018) 9—20.
Journals from the Philadelphia list or equivalent materials from FedCSIS Conferences : in blue colour.

Other scientific publications
 Publications electronic journals (after doctoral degree)
1. H.Bielak, The Local Ramsey Numbers for Some Copies of Cycles, Electronic Notes in Discrete Mathematics, vol .5, 2000, 4 pp. (electronic).
2. H.Bielak, Local and Mean Ramsey Numbers for Some Graphs, Electronic Notes in Discrete Mathematics, vol.10, 2001, 4 pp. (electronic).
3. H. Bielak, Size Ramsey Numbers for Some Regular Graphs, Electronic Notes in Discrete Math., vol. 24( 2006) 39-45.
 Reports (before doctoral degree)
1. H.Bielak, M.Sysło, Peripheral vertices in graphs, Raport Nr N-98, Inst. Informatyki Uniwersytetu Wrocławskiego, lipiec 1981, 1-11.
2. H.Bielak, On j-neighbourhoods in simple graphs, Raport Nr N-109, Inst. Informatyki Uniwersytetu Wrocławskiego, marzec 1982, 1-16.
3. H.Bielak, E. Soczewińska, On j-neighbourhoods in digraphs, Raport Nr N-111, Inst. Informatyki Uniwersytetu Wrocławskiego, maj 1982, 1-11.