𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complementary Graphs and Edge Chromatic Numbers

✍ Scribed by Alavi, Y.; Behzad, M.

Book ID
118190790
Publisher
Society for Industrial and Applied Mathematics
Year
1971
Tongue
English
Weight
233 KB
Volume
20
Category
Article
ISSN
0036-1399

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Edge-chromatic numbers of Mycielski grap
Edge-chromatic numbers of Mycielski graphs
✍ Young Soo Kwon; Jaeun Lee; Zhongfu Zhang πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 199 KB
Edge-face chromatic number and edge chro
Edge-face chromatic number and edge chromatic number of simple plane graphs
✍ 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
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

Edge-face chromatic number of Halin-grap
Edge-face chromatic number of Halin-graphs
✍ Zhongfu Zhang; Xinzhong Lu; Linzhong Liu; Jianfang Wang; Tongxin Gu πŸ“‚ Article πŸ“… 1999 πŸ› Springer 🌐 English βš– 50 KB
Acyclic edge chromatic number of outerpl
Acyclic edge chromatic number of outerplanar graphs
✍ Jian-Feng Hou; Jian-Liang Wu; Gui-Zhen Liu; Bin Liu πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 176 KB

## Abstract A proper edge coloring of a graph __G__ is called acyclic if there is no 2‐colored cycle in __G__. The acyclic edge chromatic number of __G__, denoted by Ο‡(__G__), is the least number of colors in an acyclic edge coloring of __G__. In this paper, we determine completely the acyclic edge