Halina Bielak - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2016

5Halina Bielak, Sebastain Kieliszek. dmgt, 36(3):683-694, 2016. [doi]

On the Ramsey-Goodness of PathsBinlong Li, Halina Bielak. gc, 32(6):2541-2549, 2016. [doi]

2015

The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithmHalina Bielak, Kamil Powroznik. FedCSIS 2015: 563-571 [doi]

On the generalized Wiener polarity index for some classes of graphsHalina Bielak, Kinga Dabrowska, Katarzyna Wolska. FedCSIS 2015: 483-487 [doi]

Closing the Gap on Path-Kipas Ramsey NumbersBinlong Li, Yanbo Zhang, Halina Bielak, Hajo Broersma, Premek Holub. combinatorics, 22(3):3, 2015. [doi]

2014

An efficient algorithm for the density Turán problem of some unicyclic graphsHalina Bielak, Kamil Powroznik. FedCSIS 2014: 479-486

A self-stabilizing algorithm for locating the center of Cartesian product of K2 and maximal outerplanar graphsHalina Bielak, Michal Panczyk. FedCSIS 2014: 93-99 [doi]

A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar GraphsMichal Panczyk, Halina Bielak. jucs, 20(14):1951-1963, 2014. [doi]

2013

A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree givenHalina Bielak, Michal Panczyk. FedCSIS 2013: 293-297

A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree givenHalina Bielak, Michal Panczyk. umcs, 13(1):1-10, 2013. [doi]

2012

A self-stabilizing algorithm for finding weighted centroid in treesHalina Bielak, Michal Panczyk. umcs, 12(2):27-37, 2012. [doi]

2010

Ramsey numbers for a disjoint union of good graphsHalina Bielak. DM, 310(9):1501-1505, 2010. [doi]

2009

Ramsey numbers for a disjoint union of some graphsHalina Bielak. appml, 22(4):475-477, 2009. [doi]

Size Ramsey numbers for some regular graphsHalina Bielak. DM, 309(22):6446-6449, 2009. [doi]

Multicolor Ramsey numbers for some paths and cyclesHalina Bielak. dmgt, 29(2):209-218, 2009. [doi]

2007

Ramsey and 2-local Ramsey numbers for disjoint unions of cyclesHalina Bielak. DM, 307(3-5):319-330, 2007. [doi]

Relations between 2-local and 2-mean Ramsey numbers for graphsHalina Bielak. DM, 307(7-8):827-831, 2007. [doi]

Chromatic properties of hamiltonian graphsHalina Bielak. DM, 307(11-12):1245-1254, 2007. [doi]

2006

Size Ramsey numbers for some regular graphsHalina Bielak. endm, 24:39-45, 2006. [doi]

The oriented chromatic number of some gridsHalina Bielak. umcs, 4(2):5-17, 2006.

2005

A new method for counting chromatic coefficientsHalina Bielak. umcs, 3(1):179-189, 2005.

2004

Local Ramsey numbers for copies of cyclesHalina Bielak. DM, 276(1-3):29-42, 2004. [doi]

2003

Local Ramsey numbers for some graphsHalina Bielak. DM, 266(1-3):87-99, 2003. [doi]

2001

The planar Ramsey number for ::::C::::::4:: and ::::K::::::5:: is 13Halina Bielak, Izolda Gorgol. DM, 236(1-3):43-51, 2001. [doi]

Roots of chromatic polynomialsHalina Bielak. DM, 231(1-3):97-102, 2001. [doi]

Local and Mean Ramsey Numbers for Some GraphsHalina Bielak. endm, 10:23-26, 2001. [doi]

2000

Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphsHalina Bielak. DM, 213(1-3):21-24, 2000. [doi]

Local Ramsey Numbers for Copies of CyclesHalina Bielak. endm, 5:23-26, 2000. [doi]

1999

A note on the Ramsey number and the planar Ramsey number for C4 and complete graphsHalina Bielak. dmgt, 19(2):135-142, 1999. [doi]

1998

The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number sixHalina Bielak. dmgt, 18(1):99-111, 1998. [doi]

3-gluings of wheelsHalina Bielak. dmgt, 18(1):73-84, 1998. [doi]

1997

Chromatic uniqueness in a family of 2-connected graphsHalina Bielak. DM, 164(1-3):21-28, 1997. [doi]

1993

Graphs with special neighbourhood orderings of verticesHalina Bielak. DM, 121(1-3):3-9, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL