Halina Bielak

From MaRDI portal
Person:189714

Available identifiers

zbMath Open bielak.halinaMaRDI QIDQ189714

List of research outcomes





PublicationDate of PublicationType
The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm2019-01-22Paper
https://portal.mardi4nfdi.de/entity/Q46002972018-01-08Paper
On the Ramsey-goodness of paths2017-01-13Paper
The Ramsey numbers for some subgraphs of generalized wheels versus cycles and paths2017-01-05Paper
The Turán number of the graph \(2P_5\)2016-07-13Paper
Local Ramsey numbers for copies of cycles2016-07-01Paper
Closing the gap on path-kipas Ramsey numbers2015-08-27Paper
Statuses and double branch weights of quadrangular outerplanar graphs2015-08-17Paper
A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given2015-08-06Paper
On the adjacent eccentric distance sum of graphs2015-03-23Paper
The Turàn number of the graph 3P42014-06-20Paper
A self-stabilizing algorithm for finding weighted centroid in trees2014-04-02Paper
Multicolor Ramsey numbers for some paths and cycles2010-05-14Paper
Ramsey numbers for a disjoint union of good graphs2010-05-05Paper
Size Ramsey numbers for some regular graphs2009-12-15Paper
Ramsey numbers for a disjoint union of some graphs2009-06-09Paper
https://portal.mardi4nfdi.de/entity/Q54407622008-02-05Paper
Local and Mean Ramsey Numbers for Some Graphs2007-05-29Paper
Size Ramsey numbers for some regular graphs2007-05-29Paper
Chromatic properties of Hamiltonian graphs2007-04-26Paper
Relations between 2-local and 2-mean Ramsey numbers for graphs2007-03-02Paper
Ramsey and 2-local Ramsey numbers for disjoint unions of cycles2007-02-13Paper
Local Ramsey numbers for copies of cycles2004-02-14Paper
Local Ramsey numbers for some graphs2003-06-09Paper
The planar Ramsey number for \(C_4\) and \(K_5\) is 132002-10-24Paper
Roots of chromatic polynomials2002-04-29Paper
A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs2001-04-09Paper
Sufficient condition for Hamiltonicity of \(N_2\)-locally connected claw-free graphs2000-06-22Paper
Equivalent classes for K_3-gluings of wheels1999-06-21Paper
The chromaticity of a family of 2-connected 3-chromatic graphs with five triangles and cyclomatic number six1999-04-09Paper
Chromatic uniqueness in a family of 2-connected graphs1998-01-14Paper
https://portal.mardi4nfdi.de/entity/Q42937711994-07-07Paper
Graphs with special neighbourhood orderings of vertices1994-04-18Paper
https://portal.mardi4nfdi.de/entity/Q39774971992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q32113261989-01-01Paper
On graphs with restricted link graphs and the chromatic number at most $3$1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817941987-01-01Paper
Remarks on the size Ramsey number of graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433271986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37433251986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37357361985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36867411983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33204361983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30393791983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30393801983-01-01Paper
On graphs with nonisomorphic $2$-neighbourhoods1983-01-01Paper

Research outcomes over time

This page was built for person: Halina Bielak