๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Upper bounds for the fg-chromatic index of graphs

โœ Scribed by Shin-Ichi Nakano; Takao Nishizeki; Nobuji Saito

Book ID
112079112
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
805 KB
Volume
72
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Improved bounds for the chromatic index
Improved bounds for the chromatic index of graphs and multigraphs
โœ Hakimi, S. Louis; Schmeichel, Edward F. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 321 KB ๐Ÿ‘ 2 views

We show that coloring the edges of a multigraph G in a particular order often leads to improved upper bounds for the chromatic index ฯ‡ (G). Applying this to simple graphs, we significantly generalize recent conditions based on the core of G (i.e., the subgraph of G induced by the vertices of degree

Upper Bounds of Entire Chromatic Number
Upper Bounds of Entire Chromatic Number of Plane Graphs
โœ W. Weifan ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 35 KB

The entire chromatic number ฯ‡ ve f (G) of a plane graph G is the least number of colors assigned to the vertices, edges and faces so that every two adjacent or incident pair of them receive different colors. conjectured that ฯ‡ ve f (G) โ‰ค + 4 for every plane graph G. In this paper we prove the conj

An upper bound for the harmonious chroma
An upper bound for the harmonious chromatic number of a graph
โœ Sin-Min Lee; John Mitchem ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB ๐Ÿ‘ 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o