𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new upper bound on the acyclic chromatic indices of planar graphs

✍ Scribed by Weifan Wang; Qiaojun Shu; Yiqiao Wang

Book ID
118275289
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
358 KB
Volume
34
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New upper bounds on the decomposability
New upper bounds on the decomposability of planar graphs
✍ Fedor V. Fomin; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 335 KB πŸ‘ 1 views

## Abstract It is known that a planar graph on __n__ vertices has branch‐width/tree‐width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant Ξ±. We give a proof of the best, so far, upper bound for the constant Ξ±. In particular, for th

A new upper bound for the independence n
A new upper bound for the independence number of edge chromatic critical graphs
✍ Rong Luo; Yue Zhao πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 107 KB πŸ‘ 2 views

In 1968, Vizing conjectured that if G is a -critical graph with n vertices, then (G) ≀ n / 2, where (G) is the independence number of G. In this paper, we apply Vizing and Vizing-like adjacency lemmas to this problem and prove that (G)<(((5 -6)n) / (8 -6))<5n / 8 if β‰₯ 6. α­§ 2010 Wiley