default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHalina Bielak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j28]Halina Bielak, Sebastain Kieliszek:
The Turán number of the graph 2P5. Discuss. Math. Graph Theory 36(3): 683-694 (2016)- [j27]Binlong Li, Halina Bielak:
On the Ramsey-Goodness of Paths. Graphs Comb. 32(6): 2541-2549 (2016) - 2015
- [j26]Binlong Li, Yanbo Zhang
, Halina Bielak, Hajo Broersma, Premek Holub:
Closing the Gap on Path-Kipas Ramsey Numbers. Electron. J. Comb. 22(3): 3 (2015) - 2014
- [j25]Michal Panczyk, Halina Bielak:
A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs. J. Univers. Comput. Sci. 20(14): 1951-1963 (2014) - 2013
- [j24]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): 1-10 (2013) - 2012
- [j23]Halina Bielak, Michal Panczyk:
A self-stabilizing algorithm for finding weighted centroid in trees. Ann. UMCS Informatica 12(2): 27-37 (2012) - 2010
- [j22]Halina Bielak:
Ramsey numbers for a disjoint union of good graphs. Discret. Math. 310(9): 1501-1505 (2010) - 2009
- [j21]Halina Bielak:
Ramsey numbers for a disjoint union of some graphs. Appl. Math. Lett. 22(4): 475-477 (2009) - [j20]Halina Bielak:
Size Ramsey numbers for some regular graphs. Discret. Math. 309(22): 6446-6449 (2009) - [j19]Halina Bielak:
Multicolor Ramsey numbers for some paths and cycles. Discuss. Math. Graph Theory 29(2): 209-218 (2009) - 2007
- [j18]Halina Bielak:
Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. Discret. Math. 307(3-5): 319-330 (2007) - [j17]Halina Bielak:
Relations between 2-local and 2-mean Ramsey numbers for graphs. Discret. Math. 307(7-8): 827-831 (2007) - [j16]Halina Bielak:
Chromatic properties of hamiltonian graphs. Discret. Math. 307(11-12): 1245-1254 (2007) - 2006
- [j15]Halina Bielak:
Size Ramsey numbers for some regular graphs. Electron. Notes Discret. Math. 24: 39-45 (2006) - [j14]Halina Bielak:
The oriented chromatic number of some grids. Ann. UMCS Informatica 5(1): 5-17 (2006) - 2005
- [j13]Halina Bielak:
A new method for counting chromatic coefficients. Ann. UMCS Informatica 3(1): 179-189 (2005) - 2004
- [j12]Halina Bielak:
Local Ramsey numbers for copies of cycles. Discret. Math. 276(1-3): 29-42 (2004) - 2003
- [j11]Halina Bielak:
Local Ramsey numbers for some graphs. Discret. Math. 266(1-3): 87-99 (2003) - 2001
- [j10]Halina Bielak:
Roots of chromatic polynomials. Discret. Math. 231(1-3): 97-102 (2001) - [j9]Halina Bielak, Izolda Gorgol:
The planar Ramsey number for C4 and K5 is 13. Discret. Math. 236(1-3): 43-51 (2001) - [j8]Halina Bielak:
Local and Mean Ramsey Numbers for Some Graphs. Electron. Notes Discret. Math. 10: 23-26 (2001) - 2000
- [j7]Halina Bielak:
Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. Discret. Math. 213(1-3): 21-24 (2000) - [j6]Halina Bielak:
Local Ramsey Numbers for Copies of Cycles. Electron. Notes Discret. Math. 5: 23-26 (2000) - 1999
- [j5]Halina Bielak:
A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs. Discuss. Math. Graph Theory 19(2): 135-142 (1999) - 1998
- [j4]Halina Bielak:
Equivalent classes for K3-gluings of wheels. Discuss. Math. Graph Theory 18(1): 73-84 (1998) - [j3]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): 99-111 (1998) - 1997
- [j2]Halina Bielak:
Chromatic uniqueness in a family of 2-connected graphs. Discret. Math. 164(1-3): 21-28 (1997) - 1993
- [j1]Halina Bielak:
Graphs with special neighbourhood orderings of vertices. Discret. Math. 121(1-3): 3-9 (1993)
Conference and Workshop Papers
- 2015
- [c5]Halina Bielak, Kinga Dabrowska, Katarzyna Wolska:
On the generalized Wiener polarity index for some classes of graphs. FedCSIS 2015: 483-487 - [c4]Halina Bielak, Kamil Powroznik:
The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm. FedCSIS 2015: 563-571 - 2014
- [c3]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: 93-99 - [c2]Halina Bielak, Kamil Powroznik:
An efficient algorithm for the density Turán problem of some unicyclic graphs. FedCSIS 2014: 479-486 - 2013
- [c1]Halina Bielak, Michal Panczyk:
A quasi self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given. FedCSIS 2013: 293-297
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
