✦ LIBER ✦

Beyond Ohba’s Conjecture: A bound on the choice number of k-chromatic graphs with n vertices

✍ Scribed by Noel, Jonathan A.; West, Douglas B.; Wu, Hehui; Zhu, Xuding

Book ID: 127088407
Publisher: Elsevier Science
Year: 2015
Tongue: English
Weight: 401 KB
Volume: 43
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.08.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Number of Graphs on N VERTICES WITH

The Number of Graphs on N VERTICES WITH 3 CLIQUES

✍ Reid, K. B. 📂 Article 📅 1974 🏛 Oxford University Press 🌐 English ⚖ 92 KB

On the independence number of distance g

On the independence number of distance graphs with vertices in {−1, 0, 1}n

✍ A. É. Guterman; V. K. Lyubimov; A. M. Raigorodskii; S. A. Usachev 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 522 KB

A lower bound on the number of spanning

A lower bound on the number of spanning trees with k end-vertices

✍ Katherine Heinrich; Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span

On independence numbers of distance grap

On independence numbers of distance graphs with vertices in {-1,0,1}n: estimates, conjectures, and applications to the Nelson–Erdős–Hadwiger problem and the Borsuk problem

✍ A. E. Guterman; V. K. Lyubimov; A. M. Raigorodskii; S. A. Usachev 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 274 KB