Add to ORKGThe chromatic threshold of a class of graphs is the value θ such that any graph in this class with a minimum degree greater than θn has a bounded chromatic number. Several important results related to the chromatic threshold of triangle-free graphs have been reached in the last 13 years, culminating in a result by Brandt and Thomassé stating that any triangle-free graph on n vertices with minimum degree exceeding 1/3 n has chromatic number at most 4. In this paper, the researcher examines the class of triangle-free graphs that are additionally regular. The researcher finds that any triangle-free graph on n vertices that is regular of degree (1/4+a)n with a \u3e 0 has chromatic number bounded by f (a), a function of a independent of the orde...
AbstractThe b-chromatic number of a graph G is the largest integer k, such that G admits a proper k-...
AbstractIn threshold graphs one may find weights for the vertices and a threshold value t such that ...
AbstractIn a triangle-free graph, the neighbourhood of every vertex is an independent set. We invest...
The chromatic threshold of a class of graphs is the value θ such that any graph in this class with a...
The chromatic threshold δχ(H,p) of a graph H with respect to the random graph G(n,p) is the infimum ...
The chromatic threshold δχ(H) of a graph H is the infimum of d>0 such that there exists C=C(H,d) for...
The chromatic threshold δχ(H,p) of a graph H with respect to the random graph G(n,p) is the infimum ...
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
We determine the structure of {C₃,C₅}-free graphs graphs with n vertices and minimum degree larger t...
In threshold graphs one may find weights for the vertices and a threshold value t such that for any ...
This thesis focusses on extremal graph theory, the study of how local constraints on a graph affect ...
AbstractThe b-chromatic number of a graph G is the largest integer k, such that G admits a proper k-...
AbstractIn threshold graphs one may find weights for the vertices and a threshold value t such that ...
AbstractIn a triangle-free graph, the neighbourhood of every vertex is an independent set. We invest...
The chromatic threshold of a class of graphs is the value θ such that any graph in this class with a...
The chromatic threshold δχ(H,p) of a graph H with respect to the random graph G(n,p) is the infimum ...
The chromatic threshold δχ(H) of a graph H is the infimum of d>0 such that there exists C=C(H,d) for...
The chromatic threshold δχ(H,p) of a graph H with respect to the random graph G(n,p) is the infimum ...
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
This thesis focuses on generalisations of the colouring problem in various classes of sparse graphs....
A graph with chromatic number k is called k-chromatic. Using computational methods, we show that the...
We determine the structure of {C₃,C₅}-free graphs graphs with n vertices and minimum degree larger t...
In threshold graphs one may find weights for the vertices and a threshold value t such that for any ...
This thesis focusses on extremal graph theory, the study of how local constraints on a graph affect ...
AbstractThe b-chromatic number of a graph G is the largest integer k, such that G admits a proper k-...
AbstractIn threshold graphs one may find weights for the vertices and a threshold value t such that ...
AbstractIn a triangle-free graph, the neighbourhood of every vertex is an independent set. We invest...