The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Halina Bielak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Halina Bielak
    Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:21-24 [Journal]
  2. Halina Bielak
    Roots of chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:97-102 [Journal]
  3. Halina Bielak
    Local Ramsey numbers for some graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:87-99 [Journal]
  4. Halina Bielak
    Local Ramsey numbers for copies of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:29-42 [Journal]
  5. Halina Bielak, Izolda Gorgol
    The planar Ramsey number for C4 and K5 is 13. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:43-51 [Journal]
  6. Halina Bielak
    Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:3-5, pp:319-330 [Journal]
  7. Halina Bielak
    Relations between 2-local and 2-mean Ramsey numbers for graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:827-831 [Journal]
  8. Halina Bielak
    Chromatic properties of hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:11-12, pp:1245-1254 [Journal]
  9. Halina Bielak
    Chromatic uniqueness in a family of 2-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:21-28 [Journal]
  10. Halina Bielak
    Graphs with special neighbourhood orderings of vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:3-9 [Journal]

  11. Ramsey numbers for a disjoint union of some graphs. [Citation Graph (, )][DBLP]


  12. Size Ramsey numbers for some regular graphs. [Citation Graph (, )][DBLP]


  13. Ramsey numbers for a disjoint union of good graphs. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002