✦ LIBER ✦

New physics upper bound on the branching ratio of and

✍ Scribed by Ashutosh Kumar Alok; S. Uma Sankar

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 220 KB
Volume: 167
Category: Article
ISSN: 0920-5632
DOI: 10.1016/j.nuclphysbps.2006.12.056

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound on the growth ratio of Ga

An upper bound on the growth ratio of Gaussian elimination

✍ Tuck Sang Leong 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 351 KB

An upper bound for the zero-one knapsack

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 831 KB

Upper limits on the branching ratios τ →

Upper limits on the branching ratios τ → μγ and τ → eγ

✍ P. Abreu; W. Adam; T. Adye; E. Agasi; I. Ajinenko; R. Aleksan; G.D. Alekseev; P. 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 995 KB

New upper bounds on the decomposability

New upper bounds on the decomposability of planar graphs

✍ Fedor V. Fomin; Dimitrios M. Thilikos 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB 👁 1 views

## Abstract It is known that a planar graph on __n__ vertices has branch‐width/tree‐width bounded by $\alpha \sqrt {n}$. In many algorithmic applications, it is useful to have a small bound on the constant α. We give a proof of the best, so far, upper bound for the constant α. In particular, for th

A new upper bound on the cyclic chromati

A new upper bound on the cyclic chromatic number

✍ O. V. Borodin; H. J. Broersma; A. Glebov; J. van den Heuvel 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB 👁 1 views

## Abstract A cyclic coloring of a plane graph is a vertex coloring such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a graph is its cyclic chromatic number χ^__c__^. Let Δ^\*^ be the maximum face degree of a graph. There exist

New upper bounds on the minimum size of

New upper bounds on the minimum size of covering designs

✍ Iliya Bluskov; Heikki Hämäläinen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size