We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of any graph is at most 2 plus the maximum over all subgraphs of the difference between the number of vertices and twice the independence number.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G δ(H), is an upper bound for its c...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
Abstract. In 1970, J. Folkman proved that for a given integer r and a graph G of order n there exist...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
International audienceWe give a short proof of the following theorem due to Jon H. Folkman (1969): T...
International audienceWe give a short proof of the following theorem due to Jon H. Folkman (1969): T...
AbstractThe total chromatic number XT(G) of a graph G is the least number of colours needed to colou...
We consider only simple graphs. The graph G1 + G2 consists of vertex disjoint copies of G1 and G2 an...
AbstractFour bounds for the chromatic number have been calculated for several graphs. The same metho...
In 1970, Folkman proved that for any graph G there exists a graph H with the same clique number as G...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractFour bounds for the chromatic number have been calculated for several graphs. The same metho...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractLet G be a simple graph, let Δ(G) denote the maximum degree of its vertices, and let χ(G) de...
AbstractA 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at...
The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G δ(H), is an upper bound for its c...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
Abstract. In 1970, J. Folkman proved that for a given integer r and a graph G of order n there exist...
We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of...
International audienceWe give a short proof of the following theorem due to Jon H. Folkman (1969): T...
International audienceWe give a short proof of the following theorem due to Jon H. Folkman (1969): T...
AbstractThe total chromatic number XT(G) of a graph G is the least number of colours needed to colou...
We consider only simple graphs. The graph G1 + G2 consists of vertex disjoint copies of G1 and G2 an...
AbstractFour bounds for the chromatic number have been calculated for several graphs. The same metho...
In 1970, Folkman proved that for any graph G there exists a graph H with the same clique number as G...
AbstractThe total chromatic number χT(G) of a graph G is the least number of colours needed to colou...
AbstractFour bounds for the chromatic number have been calculated for several graphs. The same metho...
AbstractWe give a new upper bound on the total chromatic number of a graph. This bound improves the ...
AbstractLet G be a simple graph, let Δ(G) denote the maximum degree of its vertices, and let χ(G) de...
AbstractA 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at...
The colouring number of a graph G, defined as col(G) = 1 + maxH⊆G δ(H), is an upper bound for its c...
summary:In this paper, we show that the maximal number of minimal colourings of a graph with $n$ ver...
Abstract. In 1970, J. Folkman proved that for a given integer r and a graph G of order n there exist...
DOI
Add to ORKG