✦ LIBER ✦

On bounds for the incidentor chromatic number of a directed weighted multigraph

✍ Scribed by V. G. Vizing

Book ID: 111471148
Publisher: Pleiades Publishing
Year: 2007
Tongue: English
Weight: 508 KB
Volume: 1
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478907040138

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The edge chromatic number of a directed/

The edge chromatic number of a directed/mixed multigraph

✍ Mel'nikov, Leonid S.; Vizing, Vadim G. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 181 KB 👁 2 views

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

Some upper bounds on the total and list

Some upper bounds on the total and list chromatic numbers of multigraphs

✍ Roland Häggkvist; Amanda Chetwynd 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 762 KB

## Abstract In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an __n__‐order multigraph exceeds the chromatic index by the smallest __t__ such that __t__! > __n__.

A sublinear bound on the chromatic index

A sublinear bound on the chromatic index of multigraphs

✍ Michael Plantholt 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 894 KB

A Combined Logarithmic Bound on the Chro

A Combined Logarithmic Bound on the Chromatic Index of Multigraphs

✍ Michael Plantholt* 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

Bounds for the harmonious chromatic numb

Bounds for the harmonious chromatic number of a graph

✍ I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

Improved bounds for the chromatic number

Improved bounds for the chromatic number of a graph

✍ S. Louis Hakimi; Edward Schmeichel 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract After giving a new proof of a well‐known theorem of Dirac on critical graphs, we discuss the elegant upper bounds of Matula and Szekeres‐Wilf which follow from it. In order to improve these bounds, we consider the following fundamental coloring problem: given an edge‐cut (__V__~1~, __V_