𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number ofKm,m-free graphs

✍ Scribed by József Balogh; Wojciech Samotij

Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
292 KB
Volume
31
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Crossing Number ofKm□Pn
On the Crossing Number ofKm□Pn
✍ Zheng Wenping; Lin Xiaohui; Yang Yuansheng; Cui Chong 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 247 KB
On the stability number of AH-free graph
On the stability number of AH-free graphs
✍ A. Hertz; D. de Werra 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 519 KB

## Abstract We describe a new class of graphs for which the stability number can be obtained in polynomial time. The algorithm is based on an iterative procedure that, at each step, builds from a graph __G__ a new graph __G^l^__ that has fewer nodes and has the property that α(__G^l^__) = α(__G__)

On the Number of Edges of Quadrilateral-
On the Number of Edges of Quadrilateral-Free Graphs
✍ Zoltán Füredi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 247 KB

If a graph has q 2 +q+1 vertices (q>13), e edges and no 4-cycles then e 1 2 q(q+1) 2 . Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdo s from the 1930's. 1996 Academic Press, Inc. ## 1. Results Let f (n) denote the maximum n

On the choice number of claw-free perfec
On the choice number of claw-free perfect graphs
✍ Sylvain Gravier; Frédéric Maffray 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 273 KB

We prove that every 3-chromatic claw-free perfect graph is 3-choosable.