✦ LIBER ✦

Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs

✍ Scribed by Xing-Chao Deng; Kai-Nan Xiang; Baoyindureng Wu

Book ID: 113449234
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 334 KB
Volume: 25
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.08.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sharp bounds for Zagreb indices of maxim

Sharp bounds for Zagreb indices of maximal outerplanar graphs

✍ Ailin Hou; Shuchao Li; Lanzhen Song; Bing Wei 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 657 KB

Upper Bounds for the Rainbow Connection

Upper Bounds for the Rainbow Connection Numbers of Line Graphs

✍ Xueliang Li; Yuefang Sun 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 462 KB

A Sharp Upper Bound for the Number of Sp

A Sharp Upper Bound for the Number of Spanning Trees of a Graph

✍ Kinkar Ch. Das 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 85 KB

A sharp upper bound for the number of st

A sharp upper bound for the number of stable sets in graphs with given number of cut edges

✍ Hongbo Hua 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.

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