𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper Bounds for the Rainbow Connection Numbers of Line Graphs

✍ Scribed by Xueliang Li; Yuefang Sun

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
462 KB
Volume
28
Category
Article
ISSN
0911-0119

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

An upper bound for the path number of a
An upper bound for the path number of a graph
✍ Alan Donald πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ LovΓ‘sz has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≀ 1/2 __u__ + __g__ ‐ 1 ≀ __n__ ‐ 1, where __n__ is the total numbe

An upper bound for the radius of a 3-con
An upper bound for the radius of a 3-connected graph
✍ Jochen Harant πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 286 KB

For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the