𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bound involving parameterσ2for the rainbow connection number

✍ Scribed by Dong, Jiu-ying; Li, Xue-liang

Book ID
121596261
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2013
Tongue
English
Weight
175 KB
Volume
29
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A general upper bound for the cyclic chr
A general upper bound for the cyclic chromatic number of 3-connected plane graphs
✍ Hikoe Enomoto; Mirko Horňák 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 457 KB 👁 1 views

## Abstract The cyclic chromatic number of a plane graph __G__ is the smallest number χ~__c__~(__G__) of colors that can be assigned to vertices of __G__ in such a way that whenever two distinct vertices are incident with a common face, they receive distinct colors. It was conjectured by Plummer an