✦ LIBER ✦

Minimally Non-Preperfect Graphs of Small Maximum Degree

✍ Scribed by Zsolt Tuza; Annegret Wagler

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 145 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730170015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Sizes of Critical Graphs with Small Maxi

Sizes of Critical Graphs with Small Maximum Degrees

✍ Xuechao Li 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 136 KB

Linear and 2-Frugal Choosability of Grap

Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree

✍ Nathann Cohen; Frédéric Havet 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 492 KB

The Number of Independent Sets in a Grap

The Number of Independent Sets in a Graph with Small Maximum Degree

✍ David Galvin; Yufei Zhao 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 180 KB

Maximum degree in graphs of diameter 2

✍ Paul Erdös; Siemion Fajtlowicz; Alan J. Hoffman 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

SparseH-Colourable Graphs of Bounded Max

SparseH-Colourable Graphs of Bounded Maximum Degree

✍ Hossein Hajiabolhassan; Xuding Zhu 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 312 KB

The minimum degree of Ramsey-minimal gra

The minimum degree of Ramsey-minimal graphs

✍ Jacob Fox; Kathy Lin 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract We write __H__ → __G__ if every 2‐coloring of the edges of graph __H__ contains a monochromatic copy of graph __G__. A graph __H__ is __G__‐__minimal__ if __H__ → __G__, but for every proper subgraph __H__′ of __H__, __H__′ ↛ __G__. We define __s__(__G__) to be the minimum __s__ such th