✦ LIBER ✦

On the Degree of Rivalry for Maximum Innovative Activity

✍ Scribed by Morton I. Kamien and Nancy L. Schwartz

Book ID: 124309758
Publisher: MIT Press
Year: 1976
Tongue: English
Weight: 361 KB
Volume: 90
Category: Article
ISSN: 0033-5533
DOI: 10.2307/1884629

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the average degree of critical graphs

On the average degree of critical graphs with maximum degree six

✍ Lianying Miao; Jibin Qu; Qingbo Sun 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 186 KB

On the independence number of graphs wit

On the independence number of graphs with maximum degree 3

✍ Kanj, Iyad; Zhang, Fenghui 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Class 1 conditions depending on the mini

Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree

✍ Thomas Niessen; Lutz Volkmann 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 694 KB

## Abstract A graph is called Class 1 if the chromatic index equals the maximum degree. We prove sufficient conditions for simple graphs to be Class 1. Using these conditions we improve results on some edge‐coloring theorems of Chetwynd and Hilton. We also improve a theorem concerning the 1‐factori

The 3-Colorability Problem on Graphs wit

The 3-Colorability Problem on Graphs with Maximum Degree Four

✍ Kochol, Martin; Lozin, Vadim; Randerath, Bert 📂 Article 📅 2003 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 189 KB

On the variable Wiener indices of trees

On the variable Wiener indices of trees with given maximum degree

✍ Muhuo Liu; Bolian Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 509 KB

The asymptotic number of graphs with a r

The asymptotic number of graphs with a restriction on the maximum degree

✍ Brendan D. McKay; Ian M. Wanless; Nicholas C. Wormald 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 72 KB