✦ LIBER ✦

Bounding the Number of Hybridisation Events for a Consistent Evolutionary History

✍ Scribed by Mihaela Baroni; Stefan Grünewald; Vincent Moulton; Charles Semple

Publisher: Springer
Year: 2005
Tongue: English
Weight: 187 KB
Volume: 51
Category: Article
ISSN: 0303-6812
DOI: 10.1007/s00285-005-0315-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the minimum number of recombination e

On the minimum number of recombination events in the evolutionary history of DNA sequences

✍ Yun S. Song; Jotun Hein 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 331 KB

A tighter bounding interval for the 1-ch

A tighter bounding interval for the 1-chromatic number of a surface

✍ Vladimir P. Korzhik 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 889 KB

Let ~1(S) be the maximum chromatic number for all graphs which can be drawn on a surface S so that each edge is crossed over by no more than one other edge. In the previous paper the author has proved that F(S) -34 ~< ~1(S), where F(S) = [\_½(9 + ~/(81 -32E(S))).J is Ringel's upper bound for xl(S) a

Bounds for the covering number of a grap

Bounds for the covering number of a graph

✍ H.L. Abbott; A.C. Liu 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 333 KB

Bounds for the harmonious chromatic numb

Bounds for the harmonious chromatic number of a graph

✍ I. Krasikov; Y. Roditty 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB 👁 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph given by Zhikang Lu and by C. McDiarmid and Luo Xinhua, independently (__Journal of Graph Theory__, 1991, pp. 345–347 and 629–636) and the lower bound given by D. G. Beane, N. L. Biggs, and B. J. Wilson (__Journal of Graph T

Improved bounds for the chromatic number

Improved bounds for the chromatic number of a graph

✍ S. Louis Hakimi; Edward Schmeichel 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 2 views

## Abstract After giving a new proof of a well‐known theorem of Dirac on critical graphs, we discuss the elegant upper bounds of Matula and Szekeres‐Wilf which follow from it. In order to improve these bounds, we consider the following fundamental coloring problem: given an edge‐cut (__V__~1~, __V_

A bound for the game chromatic number of

A bound for the game chromatic number of graphs

✍ Thomas Dinski; Xuding Zhu 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 580 KB

We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic number of these classes of graphs. In particula