AbstractIn the paper, we prove that if G is a graph embeddable on a surface of Euler characteristic ε<0 and Δ≥25−24ε+10, then χlist′(G)=Δ and χlist″(G)=Δ+1. This extends a result of Borodin, Kostochka and Woodall [O.V. Borodin, A.V. Kostochka, D.R. Woodall, List-edge and list-total colorings of multigraphs, J. Comb. Theory Series B 71 (1997) 184–204]
AbstractWe prove that if Uℏ(g) is a quasitriangular QUE algebra with universal R-matrix R, and Oℏ(G∗...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractThe achromatic number of a graph G is the largest number of colors which can be assigned to ...
AbstractThe Randić index of a graph G, denoted by R(G), is defined as the sum of 1/d(u)d(v) over all...
AbstractFor the chromatic index χ′(G) of a (multi)graph G, there are two trivial lower bounds, namel...
In my dissertation, I present results on two types of edge coloring problems for graphs. For each su...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
AbstractFor any positive integer n, let Gn denote the set of simple graphs of order n. For any graph...
Many of the most celebrated and influential results in graph coloring, such as Brooks' Theorem and V...
AbstractLet G be a simple graph with n vertices, m edges. Let Δ and δ be the maximum and minimum deg...
AbstractGould et al. (Combinatorics, Graph Theory and Algorithms, Vol. 1, 1999, pp. 387–400) conside...
We answer in the affirmative a question posed by S. Al-Addasi and H. Al-Ezeh in [Int. J. Math. Math....
Une fonction $f: V(G)\to \{1,\ldots,k\}$ est une $k$-coloration (propre) de $G$ si $|f (u) - f (v)|...
AbstractLet G be a graph of sufficiently large order n, and let the largest eigenvalue μ(G) of its a...
6 pages. Preprint submitted to the Academie des SciencesIn his book (II.5), Connes gives a proof of ...
AbstractWe prove that if Uℏ(g) is a quasitriangular QUE algebra with universal R-matrix R, and Oℏ(G∗...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractThe achromatic number of a graph G is the largest number of colors which can be assigned to ...
AbstractThe Randić index of a graph G, denoted by R(G), is defined as the sum of 1/d(u)d(v) over all...
AbstractFor the chromatic index χ′(G) of a (multi)graph G, there are two trivial lower bounds, namel...
In my dissertation, I present results on two types of edge coloring problems for graphs. For each su...
AbstractLet integers k and m be fixed and let rk(G) be the Ramsey number of the graph G in k colors....
AbstractFor any positive integer n, let Gn denote the set of simple graphs of order n. For any graph...
Many of the most celebrated and influential results in graph coloring, such as Brooks' Theorem and V...
AbstractLet G be a simple graph with n vertices, m edges. Let Δ and δ be the maximum and minimum deg...
AbstractGould et al. (Combinatorics, Graph Theory and Algorithms, Vol. 1, 1999, pp. 387–400) conside...
We answer in the affirmative a question posed by S. Al-Addasi and H. Al-Ezeh in [Int. J. Math. Math....
Une fonction $f: V(G)\to \{1,\ldots,k\}$ est une $k$-coloration (propre) de $G$ si $|f (u) - f (v)|...
AbstractLet G be a graph of sufficiently large order n, and let the largest eigenvalue μ(G) of its a...
6 pages. Preprint submitted to the Academie des SciencesIn his book (II.5), Connes gives a proof of ...
AbstractWe prove that if Uℏ(g) is a quasitriangular QUE algebra with universal R-matrix R, and Oℏ(G∗...
AbstractLet P(G,λ) be the chromatic polynomial of a graph G. A graph G is chromatically unique if fo...
AbstractThe achromatic number of a graph G is the largest number of colors which can be assigned to ...