## 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_
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
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
## 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