✦ LIBER ✦

Acquisition-extremal graphs

✍ Scribed by LeSaulnier, Timothy D.; West, Douglas B.

Book ID: 122727967
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 493 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.12.014

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal -stable graphs

✍ Illés Horváth; Gyula Y. Katona 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Extremal interval graphs

✍ Jürgen Eckhoff 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 471 KB

## Abstract An interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for t

On some extremal graphs

✍ U. S. R. Murty 📂 Article 📅 1968 🏛 Akadmiai Kiad 🌐 English ⚖ 311 KB

Extremal graphs for weights

✍ Béla Bollobás; Paul Erdös; Amites Sarkar 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 530 KB

Extremal 3-connected graphs

✍ Stephen C. Locke 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Let G be a 3-connected graph with minimum degree at least d and at least 2d vertices. For any three distinct vertices X, y, z there is a path from x to z through y and having length at least M -2. In this paper, we characterize those graphs for which no such path has length exceeding 2d -2. ## I.

Extremal graphs for homomorphisms

✍ Jonathan Cutler; A. J. Radcliffe 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed imag