AbstractMiller was the first to investigate the problem of the chromatic number of set-systems. In the present paper I give a condition concerning the number of edges, which implies that the chromatic number of the n-graph equals 2. This result is sharper than the earlier results obtained by P. Erdös, A. Hajnal and W.M. Schmidt
Abstract. Certain branch-and-bound algorithms for determining the chromatic number of a graph are pr...
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Na...
AbstractAn r-set colouring of a graph G is an assignment of r distinct colours to each vertex of G s...
AbstractMiller was the first to investigate the problem of the chromatic number of set-systems. In t...
We show that the minimum number of edges in a graph on n vertices with oriented chromatic number n ...
For a nontrivial connected graph G, let c: V(G)→ N be a vertex coloring of G where adjacent vertices...
In the area of graph colorings, much research has been done on the topic of neighbor- distinguishing...
In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) re...
We show that the minimum number of edges in a graph on n vertices with oriented chromatic number n i...
AbstractWe estimate the chromatic number of graphs whose vertex set is the set of edges of a complet...
An r-set colouring of a graph G is an assignment of r distinct colours to each vertex of G so that t...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
For a nontrivial connected graph G, let c : V (G) → ℕ be a vertex coloring of G where adjacent vert...
AbstractAn r-set colouring of a graph G is an assignment of r distinct colours to each vertex of G s...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
Abstract. Certain branch-and-bound algorithms for determining the chromatic number of a graph are pr...
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Na...
AbstractAn r-set colouring of a graph G is an assignment of r distinct colours to each vertex of G s...
AbstractMiller was the first to investigate the problem of the chromatic number of set-systems. In t...
We show that the minimum number of edges in a graph on n vertices with oriented chromatic number n ...
For a nontrivial connected graph G, let c: V(G)→ N be a vertex coloring of G where adjacent vertices...
In the area of graph colorings, much research has been done on the topic of neighbor- distinguishing...
In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) re...
We show that the minimum number of edges in a graph on n vertices with oriented chromatic number n i...
AbstractWe estimate the chromatic number of graphs whose vertex set is the set of edges of a complet...
An r-set colouring of a graph G is an assignment of r distinct colours to each vertex of G so that t...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
For a nontrivial connected graph G, let c : V (G) → ℕ be a vertex coloring of G where adjacent vert...
AbstractAn r-set colouring of a graph G is an assignment of r distinct colours to each vertex of G s...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
Abstract. Certain branch-and-bound algorithms for determining the chromatic number of a graph are pr...
We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Na...
AbstractAn r-set colouring of a graph G is an assignment of r distinct colours to each vertex of G s...
DOI
Add to ORKG