𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note onn-edge chromatic number

✍ Scribed by Sun Liang; Zhang Zhongfu


Book ID
105641304
Publisher
Springer
Year
1997
Tongue
English
Weight
148 KB
Volume
42
Category
Article
ISSN
1001-6538

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Edge-face chromatic number and edge chro
✍ Rong Luo; Cun-Quan Zhang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function Ο• : __E__(__G__) βˆͺ __F__(G) →  {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) βˆͺ __F__(__G__), Ο•(__a__) ≠ ϕ(__b__). Let Ο‡~e~(__G__), Ο‡~ef~(__G__), and Ξ”(__G_

Regular graphs and edge chromatic number
✍ R.J Faudree; J Sheehan πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 376 KB

For any simple graph G, Vizing's Theorem [5] implies that A (G)~)((G)<~ A(G)+ 1, where A (G) is the maximum degree of a vertex in G and x(G) is the edge chromatic number. It is of course possible to add edges to G without changing its edge chromatic number. Any graph G is a spanning subgraph of an e

On the edge-chromatic number of a graph
✍ Lowell W. Beineke; Robin J. Wilson πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 427 KB
A note on the star chromatic number
✍ J. A. Bondy; Pavol Hell πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 176 KB πŸ‘ 1 views

## Abstract A. Vince introduced a natural generalization of graph coloring and proved some basic facts, revealing it to be a concept of interest. His work relies on continuous methods. In this note we make some simple observations that lead to a purely combinatorial treatment. Our methods yield sho

Edge-chromatic numbers of Mycielski grap
✍ Young Soo Kwon; Jaeun Lee; Zhongfu Zhang πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 199 KB