| |
| 2009 | ||
|---|---|---|
| 14 | EE | Halina Bielak: Ramsey numbers for a disjoint union of some graphs. Appl. Math. Lett. 22(4): 475-477 (2009) |
| 2007 | ||
| 13 | EE | Halina Bielak: Chromatic properties of hamiltonian graphs. Discrete Mathematics 307(11-12): 1245-1254 (2007) |
| 12 | EE | Halina Bielak: Ramsey and 2-local Ramsey numbers for disjoint unions of cycles. Discrete Mathematics 307(3-5): 319-330 (2007) |
| 11 | EE | Halina Bielak: Relations between 2-local and 2-mean Ramsey numbers for graphs. Discrete Mathematics 307(7-8): 827-831 (2007) |
| 2006 | ||
| 10 | EE | Halina Bielak: Size Ramsey numbers for some regular graphs. Electronic Notes in Discrete Mathematics 24: 39-45 (2006) |
| 2004 | ||
| 9 | EE | Halina Bielak: Local Ramsey numbers for copies of cycles. Discrete Mathematics 276(1-3): 29-42 (2004) |
| 2003 | ||
| 8 | EE | Halina Bielak: Local Ramsey numbers for some graphs. Discrete Mathematics 266(1-3): 87-99 (2003) |
| 2001 | ||
| 7 | EE | Halina Bielak: Roots of chromatic polynomials. Discrete Mathematics 231(1-3): 97-102 (2001) |
| 6 | EE | Halina Bielak, Izolda Gorgol: The planar Ramsey number for C4 and K5 is 13. Discrete Mathematics 236(1-3): 43-51 (2001) |
| 5 | EE | Halina Bielak: Local and Mean Ramsey Numbers for Some Graphs. Electronic Notes in Discrete Mathematics 10: 23-26 (2001) |
| 2000 | ||
| 4 | EE | Halina Bielak: Sufficient condition for Hamiltonicity of N2-locally connected claw-free graphs. Discrete Mathematics 213(1-3): 21-24 (2000) |
| 3 | EE | Halina Bielak: Local Ramsey Numbers for Copies of Cycles. Electronic Notes in Discrete Mathematics 5: 23-26 (2000) |
| 1997 | ||
| 2 | EE | Halina Bielak: Chromatic uniqueness in a family of 2-connected graphs. Discrete Mathematics 164(1-3): 21-28 (1997) |
| 1993 | ||
| 1 | EE | Halina Bielak: Graphs with special neighbourhood orderings of vertices. Discrete Mathematics 121(1-3): 3-9 (1993) |
| 1 | Izolda Gorgol | [6] |