Graphs with special neighbourhood orderings of vertices. - Halina Bielak (Discret. Math., 1993)

Chromatic uniqueness in a family of 2-connected graphs. - Halina Bielak (Discret. Math., 1997)

Equivalent classes for K3-gluings of wheels. - Halina Bielak (Discuss. Math. Graph Theory, 1998)

The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six. - Halina Bielak (Discuss. Math. Graph Theory, 1998)

A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs. - Halina Bielak (Discuss. Math. Graph Theory, 1999)

Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. - Halina Bielak (Discret. Math., 2000)

Local Ramsey Numbers for Copies of Cycles. - Halina Bielak (Electron. Notes Discret. Math., 2000)

Roots of chromatic polynomials. - Halina Bielak (Discret. Math., 2001)

The planar Ramsey number for C4 and K5 is 13. - Halina Bielak; Izolda Gorgol (Discret. Math., 2001)

Local and Mean Ramsey Numbers for Some Graphs. - Halina Bielak (Electron. Notes Discret. Math., 2001)

Local Ramsey numbers for some graphs. - Halina Bielak (Discret. Math., 2003)

A new method for counting chromatic coefficients. - Halina Bielak (Ann. UMCS Informatica, 2005)

Size Ramsey numbers for some regular graphs. - Halina Bielak (Electron. Notes Discret. Math., 2006)

The oriented chromatic number of some grids. - Halina Bielak (Ann. UMCS Informatica, 2006)

Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. - Halina Bielak (Discret. Math., 2007)

Relations between 2-local and 2-mean Ramsey numbers for graphs. - Halina Bielak (Discret. Math., 2007)

Chromatic properties of hamiltonian graphs. - Halina Bielak (Discret. Math., 2007)

Ramsey numbers for a disjoint union of some graphs. - Halina Bielak (Appl. Math. Lett., 2009)

Multicolor Ramsey numbers for some paths and cycles. - Halina Bielak (Discuss. Math. Graph Theory, 2009)

Ramsey numbers for a disjoint union of good graphs. - Halina Bielak (Discret. Math., 2010)

A self-stabilizing algorithm for finding weighted centroid in trees. - Halina Bielak; Michal Panczyk (Ann. UMCS Informatica, 2012)

A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. - Halina Bielak; Michal Panczyk (FedCSIS, 2013)

A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. - Halina Bielak; Michal Panczyk (Ann. UMCS Informatica, 2013)

An efficient algorithm for the density Turán problem of some unicyclic graphs. - Halina Bielak; Kamil Powroznik (FedCSIS, 2014)

A self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphs. - Halina Bielak; Michal Panczyk (FedCSIS (Position Papers), 2014)

A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs. - Michal Panczyk; Halina Bielak (J. Univers. Comput. Sci., 2014)

On the generalized Wiener polarity index for some classes of graphs. - Halina Bielak; Kinga Dabrowska; Katarzyna Wolska (FedCSIS, 2015)

The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm. - Halina Bielak; Kamil Powroznik (FedCSIS, 2015)

Closing the Gap on Path-Kipas Ramsey Numbers. - Binlong Li; Yanbo Zhang; Halina Bielak; Hajo Broersma; Premek Holub (Electron. J. Comb., 2015)

The Turán number of the graph 2P5. - Halina Bielak; Sebastain Kieliszek (Discuss. Math. Graph Theory, 2016)

On the Ramsey-Goodness of Paths. - Binlong Li; Halina Bielak (Graphs Comb., 2016)