✦ LIBER ✦

The size of a minimum five-chromatic K4-free graph

✍ Scribed by Denis Hanson; Gary MacGillivray; Dale Youngs

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 147 KB
Volume: 122
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90309-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of triangles in a K4-free gra

The number of triangles in a K4-free graph

✍ David C. Fisher 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 367 KB

We show that a &-

The strong chromatic index of C4-free gr

The strong chromatic index of C4-free graphs

✍ Mohammad Mahdian 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

The minimum augmentation of any graph to

The minimum augmentation of any graph to a K-edge-connected graph

✍ Guo-Ray Cai; Yu-Geng Sun 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 883 KB

K4-free graphs with no odd hole: Even pa

K4-free graphs with no odd hole: Even pairs and the circular chromatic number

✍ Yori Zwols 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

An odd hole in a graph is an induced cycle of odd length at least five. In this article we show that every imperfect K 4 -free graph with no odd hole either is one of two basic graphs, or has an even pair or a clique cutset. We use this result to show that every K 4 -free graph with no odd hole has

The minimum size of graphs hamiltonian-c

The minimum size of graphs hamiltonian-connected from a vertex

✍ C.J. Knickerbocker; Patti Frazer Lock; Michael Sheard 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A gap between the appearances of a k-cor

A gap between the appearances of a k-core and a (k + 1)-chromatic graph

✍ Michael Molloy 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB 👁 1 views

We observe that the values of p for which with high probability Gm,p is k-colorable and for which with high probability G,,p has no k-core are not equal for k 2 4.