AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographic product of G and H be denoted GlexH. Main results: (i) ρ(GlexH)≤χf(G)ρ(H); (ii) if ρ(G)=χf(G) then ρ(GlexH)=ρ(G)ρ(H) for all H; (iii) χf−ρ is unbounded. In addition, the question of how big χf/ρ can be is discussed
Abstract: Let f(n) minf (G H) : G and H are n-chromatic digraphsg and g(n) minf (G H) : G and H ...
AbstractFor a graph G on n vertices with chromatic number χ(G), the Nordhaus–Gaddum inequalities sta...
AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point i...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
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 χ...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
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...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
AbstractHall's condition for the existence of a proper vertex list-multicoloring of a simple graph G...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
Abstract: Let f(n) minf (G H) : G and H are n-chromatic digraphsg and g(n) minf (G H) : G and H ...
AbstractFor a graph G on n vertices with chromatic number χ(G), the Nordhaus–Gaddum inequalities sta...
AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point i...
For graphs G and H let G[H] be their lexicographic product and let χf (G) = inf{χ(G[Kn])/n | n = 1, ...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
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 χ...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
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...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
AbstractHall's condition for the existence of a proper vertex list-multicoloring of a simple graph G...
An upper bound for the chromatic number of the lexicographic product of graphs which unifies and gen...
Abstract: Let f(n) minf (G H) : G and H are n-chromatic digraphsg and g(n) minf (G H) : G and H ...
AbstractFor a graph G on n vertices with chromatic number χ(G), the Nordhaus–Gaddum inequalities sta...
AbstractThe values of the chromatic and achromatic number, point- and line-connectivity, and point i...