𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved edge-coloring algorithms for planar graphs

✍ Scribed by Marek Chrobak; Takao Nishizeki

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
808 KB
Volume
11
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Acyclic edge coloring of triangle-free p
Acyclic edge coloring of triangle-free planar graphs
✍ Manu Basavaraju; L. Sunil Chandran πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 233 KB πŸ‘ 2 views

An __acyclic__ edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The __acyclic chromatic index__ of a graph is the minimum number __k__ such that there is an acyclic edge coloring using __k__ colors and is denoted by __a__β€²(__G__). It was conjectured by Al

Parallel Algorithms for the Edge-Colorin
Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems
✍ Weifa Liang; Xiaojun Shen; Qing Hu πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 342 KB

In fact, Vizing's proof implies an O(nm) time algorithm with ⌬ Ο© 1 colors for the edge-coloring problem. However, Holyer has shown that deciding whether a graph requires ⌬ or ⌬ Ο© 1 colors is NP-complete [10]. For a multigraph G, Shannon showed that Ј(G) Υ… 3⌬/2 [16]. A number of parallel algorithms

Algorithms for coloring semi-random grap
Algorithms for coloring semi-random graphs
✍ C. R. Subramanian; Martin FΓΌrer; C. E. Veni Madhavan πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 373 KB πŸ‘ 3 views

The graph coloring problem is to color a given graph with the minimum number of colors. This problem is known to be NP-hard even if we are only aiming at approximate solutions. On the other hand, the best known approximation algorithms require ␦ Ž . Ž . n ␦ ) 0 colors even for bounded chromatic k-co