The edge chromatic number of a directed/mixed multigraph
β Scribed by Mel'nikov, Leonid S.; Vizing, Vadim G.
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 181 KB
- Volume
- 31
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider colorings of the directed and undirected edges of a mixed multigraph G by an ordered set of colors. We color each undirected edge in one color and each directed edge in two colors, such that the color of the first half of a directed edge is smaller than the color of the second half. The colors used at the same vertex are all different. A bound for the minimum number of colors needed for such colorings is obtained. In the case where G has only directed
π SIMILAR VOLUMES
The interval number of a graph G, denoted by i(G), is the least natural number t such that G is the intersection graph of sets, each of which is the union of at most t intervals. Here we settle a conjecture of Griggs and West about bounding i(G) in terms of e, that is, the number of edges in G. Name
Let k be a positive integer, and D = (V (D), E(D)) be a minimally k-edge-connected simple digraph. We denote the outdegree and indegree of x β V (D) by Ξ΄ D (x) and Ο D (x), respectively. Let u + (D) denote the number of vertices W. Mader asked the following question in [Mader, in Paul ErdΓΆs is Eigh
In memory of Ron
P-selectin glycoprotein ligand 1 (PSGL-1) is an adhesion receptor localized on the tips of microvilli that is involved in the rolling of neutrophils on activated endothelium. We found that PSGL-1 was concentrated at the uropod of chemokine-stimulated lymphoid cells. Dynamic fluorescence videomicrosc