✦ LIBER ✦

A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph

✍ Scribed by Carlos J. Luz; Domingos M. Cardoso

Book ID: 110380217
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 120 KB
Volume: 81
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018965309522

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectral Characterizations of the Lovász

Spectral Characterizations of the Lovász Number and the Delsarte Number of a Graph

✍ A. Galtman 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 74 KB

On Some Problems of Lovász Concerning th

On Some Problems of Lovász Concerning the Shannon Capacity of a Graph

✍ Haemers, W. 📂 Article 📅 1979 🏛 IEEE 🌐 English ⚖ 299 KB

On a Conjecture of Lovász Concerning Bri

On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph

✍ Marcelo H. de Carvalho; Cláudio L. Lucchesi; U.S.R. Murty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 292 KB

In 1987, Lova ´sz conjectured that every brick G different from K 4 , C ¯6, and the Petersen graph has an edge e such that G -e is a matching covered graph with exactly one brick. Lova ´sz and Vempala announced a proof of this conjecture in 1994. Their paper is under preparation. In this paper and i

On the Edge Independence Number of a Reg

On the Edge Independence Number of a Regular Graph with Large Edge Connectivity

✍ IZAK BROERE; GARY CHARTRAND; ORTRUND R. OELLERMANN; CURTISS E. WALL 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

An upper bound for the number of Euleria

An upper bound for the number of Eulerian orientations of a regular graph

✍ M. Las Vergnas 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 168 KB

An upper bound on the independence numbe

An upper bound on the independence number of a graph computable in polynomial-time

✍ Carlos J. Luz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 450 KB