𝔖 Bobbio Scriptorium
✦   LIBER   ✦

NOTE – Edge-Coloring Cliques with Many Colors on Subcliques

✍ Scribed by Dennis Eichhorn; Dhruv Mubayi

Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
128 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Adjacent Strong Edge Coloring
A Note on Adjacent Strong Edge Coloring ofK(n,m)
✍ Jing-wen Li; Zhong-fu Zhang; Xiang-en Chen; Yi-rong Sun 📂 Article 📅 2006 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 130 KB
An upper bound on the number of edges of
An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree
✍ Lian-ying Miao; Shi-you Pang; Jian-liang Wu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 100 KB

In this paper, we prove that any edge-coloring critical graph G with maximum degree ¿ (11 + √ 49 -24 )=2, where 6 1, has the size at least 3(|V (G)| -) + 1 if 6 7 or if ¿ 8 and |V (G)| ¿ 2 --4 -( + 6)=( -6), where is the minimum degree of G. It generalizes a result of Sanders and Zhao.