✦ LIBER ✦

Bounds on eigenvalues and chromatic numbers

✍ Scribed by Cao, D

Book ID: 120116007
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 361 KB
Volume: 270
Category: Article
ISSN: 0024-3795
DOI: 10.1016/S0024-3795(98)80009-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on eigenvalues and chromatic numb

Bounds on eigenvalues and chromatic numbers

✍ Dasong Cao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 455 KB

We give new bounds on eigenvalue of graphs which imply some known bounds. In particular, if T(G) is the maximum sum of degrees of vertices a~t to a vertex in a graph G, the largest eigenvalue p(G) of G satisfies p(G) <~ ~IT(G) with equality if and only if either G is regular or G is bipartite and su

Lower Bounds for Measurable Chromatic Nu

Lower Bounds for Measurable Chromatic Numbers

✍ Christine Bachoc; Gabriele Nebe; Fernando Mário de Oliveira Filho; Frank Vallent 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 263 KB

Copositive programming motivated bounds

Copositive programming motivated bounds on the stability and the chromatic numbers

✍ Igor Dukanovic; Franz Rendl 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 274 KB

A Bound on the Total Chromatic Number

✍ Michael Molloy; Bruce Reed 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 481 KB

Some upper bounds on the total and list

Some upper bounds on the total and list chromatic numbers of multigraphs

✍ Roland Häggkvist; Amanda Chetwynd 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 762 KB

## Abstract In this paper we discuss some estimates for upper bounds on a number of chromatic parameters of a multigraph. In particular, we show that the total chromatic number for an __n__‐order multigraph exceeds the chromatic index by the smallest __t__ such that __t__! > __n__.

Bounds on chromatic numbers of multiple

Bounds on chromatic numbers of multiple factors of a complete graph

✍ Ján Plesník 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB 👁 1 views

## Abstract Bounds on the sum and product of the chromatic numbers of __n__ factors of a complete graph of order __p__ are shown to exist. The well‐known theorem of Nordhaus and Gaddum solves the problem for __n__ = 2. Strict lower and some upper bounds for any __n__ and strict upper bounds for __n