Topics
chromaticSupreme court of the united states case
chromatic numberSupreme court of the united states case
summary:We show that the minimum chromatic number of a product of two $n$-chromatic graphs is either bounded by 9, or tends to infinity. The result is obtained by the study of coloring iterated adjoints of a digraph by iterated antichains of a poset
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semic...
AbstractWe wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and ...
For an integer k≥1k≥1, the kkth interleaved adjoint of a digraph GG is the digraph ιk(G)ιk(G) with...
summary:We show that the minimum chromatic number of a product of two $n$-chromatic graphs is either...
AbstractFor an integer k≥1, the kth interleaved adjoint of a digraph G is the digraph ιk(G) with ver...
International audienceWe prove that the acyclic chromatic number of a graph with maximum degree ∆ is...
We have observations concerning the set theoretic strength of the following combinatorial statements...
AbstractIn this paper the concept of dichromatic number of a digraph which is a generalization of th...
AbstractGiven a graph G and a positive integer p, χp(G) is the minimum number of colours needed to c...
Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosabilit...
AbstractGrünbaum's conjecture on the existence of k-chromatic graphs of degree k and girth g for eve...
AbstractFor a simple graph G with chromatic number χ(G), the Nordhaus-Gaddum inequalities give upper...
AbstractWe give a new and more direct proof of the characterization theorem for finitary homomorphis...
The dichromatic number of a digraph $G$ is the smallest integer $\chi_a(G)$ such that the vertex set...
In the thesis, the coloring of digraphs is studied. The chromatic number of a digraph D is the small...
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semic...
AbstractWe wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and ...
For an integer k≥1k≥1, the kkth interleaved adjoint of a digraph GG is the digraph ιk(G)ιk(G) with...
summary:We show that the minimum chromatic number of a product of two $n$-chromatic graphs is either...
AbstractFor an integer k≥1, the kth interleaved adjoint of a digraph G is the digraph ιk(G) with ver...
International audienceWe prove that the acyclic chromatic number of a graph with maximum degree ∆ is...
We have observations concerning the set theoretic strength of the following combinatorial statements...
AbstractIn this paper the concept of dichromatic number of a digraph which is a generalization of th...
AbstractGiven a graph G and a positive integer p, χp(G) is the minimum number of colours needed to c...
Let ch(G) denote the choice number of a graph G (also called “list chromatic number” or “choosabilit...
AbstractGrünbaum's conjecture on the existence of k-chromatic graphs of degree k and girth g for eve...
AbstractFor a simple graph G with chromatic number χ(G), the Nordhaus-Gaddum inequalities give upper...
AbstractWe give a new and more direct proof of the characterization theorem for finitary homomorphis...
The dichromatic number of a digraph $G$ is the smallest integer $\chi_a(G)$ such that the vertex set...
In the thesis, the coloring of digraphs is studied. The chromatic number of a digraph D is the small...
A digraph is semicomplete if any two vertices are connected by at least one arc and is locally semic...
AbstractWe wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and ...
For an integer k≥1k≥1, the kkth interleaved adjoint of a digraph GG is the digraph ιk(G)ιk(G) with...
Add to ORKG