For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, 2,...} be the fractional chromatic number of G. For n ≥ 1 set Gn = {G | χ(G[Kn]) = nχ(G)}. Then limn→ ∞ Gn = {G | χf (G) = χ(G)}. Moreover, we prove that for any n ≥ 2 the class Gn forms a proper subclass of Gn−1. As a by-product we show that if G is a χ∗-extremal, vertex transitive graph on χ(G)α(G) − 1 vertices, then for any graph H we have χ(G[H]) = χ(G)χ(H) − bχ(H)/α(G)c
AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the indepen...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
International audienceWe introduce a new method for computing bounds on the independence number and ...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinar...
AbstractLet G[H] be the lexicographic product of graphs G and H and let G ⊕ H be their Cartesian sum...
Let G[H] be the lexicographic product of graphs G and H and let G⊕H be their Cartesian sum. It is pr...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
For m,n ∈ N, the fractional power G mn of a graph G is the mth power of the n-subdivision of G, wher...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the indepen...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
International audienceWe introduce a new method for computing bounds on the independence number and ...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinar...
AbstractLet G[H] be the lexicographic product of graphs G and H and let G ⊕ H be their Cartesian sum...
Let G[H] be the lexicographic product of graphs G and H and let G⊕H be their Cartesian sum. It is pr...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
For m,n ∈ N, the fractional power G mn of a graph G is the mth power of the n-subdivision of G, wher...
Reed conjectured that for every ϵ>0 and Δ there exists g such that the fractional total chromatic nu...
Reed conjectured that for every > 0 and ∆ there exists g such that the fractional total chromatic...
AbstractLet G be a triangle-free graph with maximum degree at most 3. Staton proved that the indepen...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
International audienceWe introduce a new method for computing bounds on the independence number and ...