✦ LIBER ✦

On the edge-chromatic number of a graph

✍ Scribed by Lowell W. Beineke; Robin J. Wilson

Book ID: 107748136
Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 427 KB
Volume: 5
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90023-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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_

The independence number of an edge-chrom

The independence number of an edge-chromatic critical graph

✍ Douglas R. Woodall 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB 👁 1 views

A graph G with maximum degree and edge chromatic number (G)> is edge--critical if (G -e) = for every edge e of G. It is proved here that the vertex independence number of an edge--critical graph of order n is less than 3 5 n. For large , this improves on the best bound previously known, which was ro

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

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

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

On the harmonious chromatic number of a

On the harmonious chromatic number of a graph

✍ John Mitchem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe