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
AbstractIn the paper, we prove that if G is a graph embeddable on a surface of Euler characteristic ...
AbstractLet G be a spanning subgraph of the complete bipartite graph Kn,n. In this paper, we obtain ...
AbstractThe hypergraph product G□H has vertex set V(G)×V(H), and edge set {e×f:e∈E(G),f∈E(H)}, where...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
AbstractThis paper proves that the fractional version of Hedetniemi’s conjecture is true. Namely, fo...
AbstractHall's condition for the existence of a proper vertex list-multicoloring of a simple graph G...
100學年度研究獎補助論文[[abstract]]A k-fold coloring of a graph assigns to each vertex a set of k colors, and ...
AbstractLet G□H denote the Cartesian product of graphs G and H. In this paper, we study the {k}-domi...
AbstractWe consider the {k}-domination number γ{k}(G) of a graph G and the Cartesian product G□H and...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
Assume $n, m$ are positive integers and $G$ is a graph. Let $P_{n,m}$ be the graph obtained from the...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
We answer in the affirmative a question posed by S. Al-Addasi and H. Al-Ezeh in [Int. J. Math. Math....
AbstractIn the paper, we prove that if G is a graph embeddable on a surface of Euler characteristic ...
AbstractLet G be a spanning subgraph of the complete bipartite graph Kn,n. In this paper, we obtain ...
AbstractThe hypergraph product G□H has vertex set V(G)×V(H), and edge set {e×f:e∈E(G),f∈E(H)}, where...
AbstractLet χf denote the fractional chromatic number and ρ the Hall ratio, and let the lexicographi...
summary:One consequence of Hedetniemi's conjecture on the chromatic number of the product of graphs ...
AbstractThe Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence...
AbstractThis paper proves that the fractional version of Hedetniemi’s conjecture is true. Namely, fo...
AbstractHall's condition for the existence of a proper vertex list-multicoloring of a simple graph G...
100學年度研究獎補助論文[[abstract]]A k-fold coloring of a graph assigns to each vertex a set of k colors, and ...
AbstractLet G□H denote the Cartesian product of graphs G and H. In this paper, we study the {k}-domi...
AbstractWe consider the {k}-domination number γ{k}(G) of a graph G and the Cartesian product G□H and...
AbstractFor graphs G and H let G[H] be their lexicographic product and let χƒ(G) = inf{χ(G[Kn])/n | ...
Assume $n, m$ are positive integers and $G$ is a graph. Let $P_{n,m}$ be the graph obtained from the...
AbstractIt is shown that the difference between the chromatic number χ and the fractional chromatic ...
We answer in the affirmative a question posed by S. Al-Addasi and H. Al-Ezeh in [Int. J. Math. Math....
AbstractIn the paper, we prove that if G is a graph embeddable on a surface of Euler characteristic ...
AbstractLet G be a spanning subgraph of the complete bipartite graph Kn,n. In this paper, we obtain ...
AbstractThe hypergraph product G□H has vertex set V(G)×V(H), and edge set {e×f:e∈E(G),f∈E(H)}, where...