Halina Bielak

Publication Activity (10 Years)

Years Active: 1993-2016
Publications (10 Years): 2

Top Topics

Breadth First Search

Cartesian Product

Top Venues

Ann. UMCS Informatica

Electron. J. Comb.

J. Univers. Comput. Sci.

Publications

Binlong Li, Halina Bielak
On the Ramsey-Goodness of Paths. Graphs Comb. 32 (6) (2016)
Halina Bielak, Sebastain Kieliszek
. Discuss. Math. Graph Theory 36 (3) (2016)
Binlong Li, Yanbo Zhang, Halina Bielak, Hajo Broersma, Premek Holub
Closing the Gap on Path-Kipas Ramsey Numbers. Electron. J. Comb. 22 (3) (2015)
Halina Bielak, Kamil Powroznik
The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm. FedCSIS (2015)
Halina Bielak, Kinga Dabrowska, Katarzyna Wolska
On the generalized Wiener polarity index for some classes of graphs. FedCSIS (2015)
Halina Bielak, Michal Panczyk
A self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs. FedCSIS (Position Papers) (2014)
Michal Panczyk, Halina Bielak
A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs. J. Univers. Comput. Sci. 20 (14) (2014)
Halina Bielak, Kamil Powroznik
An efficient algorithm for the density Turán problem of some unicyclic graphs. FedCSIS (2014)
Halina Bielak, Michal Panczyk
A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. FedCSIS (2013)
Halina Bielak, Michal Panczyk
A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. Ann. UMCS Informatica 13 (1) (2013)
Halina Bielak, Michal Panczyk
A self-stabilizing algorithm for finding weighted centroid in trees. Ann. UMCS Informatica 12 (2) (2012)
Halina Bielak
Ramsey numbers for a disjoint union of good graphs. Discret. Math. 310 (9) (2010)
Halina Bielak
Multicolor Ramsey numbers for some paths and cycles. Discuss. Math. Graph Theory 29 (2) (2009)
Halina Bielak
Size Ramsey numbers for some regular graphs. Discret. Math. 309 (22) (2009)
Halina Bielak
Ramsey numbers for a disjoint union of some graphs. Appl. Math. Lett. 22 (4) (2009)
Halina Bielak
Chromatic properties of hamiltonian graphs. Discret. Math. 307 (11-12) (2007)
Halina Bielak
Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. Discret. Math. 307 (3-5) (2007)
Halina Bielak
Relations between 2-local and 2-mean Ramsey numbers for graphs. Discret. Math. 307 (7-8) (2007)
Halina Bielak
The oriented chromatic number of some grids. Ann. UMCS Informatica 5 (1) (2006)
Halina Bielak
Size Ramsey numbers for some regular graphs. Electron. Notes Discret. Math. 24 (2006)
Halina Bielak
A new method for counting chromatic coefficients. Ann. UMCS Informatica 3 (1) (2005)
Halina Bielak
Local Ramsey numbers for copies of cycles. Discret. Math. 276 (1-3) (2004)
Halina Bielak
Local Ramsey numbers for some graphs. Discret. Math. 266 (1-3) (2003)
Halina Bielak, Izolda Gorgol
is 13. Discret. Math. 236 (1-3) (2001)
Halina Bielak
Roots of chromatic polynomials. Discret. Math. 231 (1-3) (2001)
Halina Bielak
Local and Mean Ramsey Numbers for Some Graphs. Electron. Notes Discret. Math. 10 (2001)
Halina Bielak
Local Ramsey Numbers for Copies of Cycles. Electron. Notes Discret. Math. 5 (2000)
Halina Bielak
Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. Discret. Math. 213 (1-3) (2000)
Halina Bielak
A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs. Discuss. Math. Graph Theory 19 (2) (1999)
Halina Bielak
-gluings of wheels. Discuss. Math. Graph Theory 18 (1) (1998)
Halina Bielak
The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six. Discuss. Math. Graph Theory 18 (1) (1998)
Halina Bielak
Chromatic uniqueness in a family of 2-connected graphs. Discret. Math. 164 (1-3) (1997)
Halina Bielak
Graphs with special neighbourhood orderings of vertices. Discret. Math. 121 (1-3) (1993)