AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(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|χƒ(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) − ⌊χ(H)/α(G)⌋
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
AbstractFor any k∈N, the k-subdivision of graph G is a simple graph G1k which is constructed by repl...
AbstractThe generalized Mycielskians of graphs (also known as cones over graphs) are the natural gen...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
AbstractThe star-chromatic number and the fractional-chromatic number are two generalizations of the...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinar...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
AbstractThis paper proves that the fractional version of Hedetniemi’s conjecture is true. Namely, fo...
Assume $n, m$ are positive integers and $G$ is a graph. Let $P_{n,m}$ be the graph obtained from the...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
AbstractThe circular chromatic number χc(G) and the fractional chromatic number χf(G) are two genera...
International audienceZykov designed one of the oldest known families of triangle-free graphs with a...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
AbstractFor any k∈N, the k-subdivision of graph G is a simple graph G1k which is constructed by repl...
AbstractThe generalized Mycielskians of graphs (also known as cones over graphs) are the natural gen...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
AbstractThe star-chromatic number and the fractional-chromatic number are two generalizations of the...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
The star-chromatic number and the fractional-chromatic number are two generalizations of the ordinar...
It is shown that the difference between the chromatic number χ and the fractional chromatic number χ...
AbstractThis paper proves that the fractional version of Hedetniemi’s conjecture is true. Namely, fo...
Assume $n, m$ are positive integers and $G$ is a graph. Let $P_{n,m}$ be the graph obtained from the...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
AbstractThe circular chromatic number χc(G) and the fractional chromatic number χf(G) are two genera...
International audienceZykov designed one of the oldest known families of triangle-free graphs with a...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
AbstractFor any k∈N, the k-subdivision of graph G is a simple graph G1k which is constructed by repl...
AbstractThe generalized Mycielskians of graphs (also known as cones over graphs) are the natural gen...