𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hall ratio of the Mycielski graphs

✍ Scribed by Mathew Cropper; András Gyárfás; Jenő Lehel

Book ID
108113571
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
143 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The fractional chromatic number of mycie
The fractional chromatic number of mycielski's graphs
✍ Michael Larsen; James Propp; Daniel Ullman 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to Mycielski, who constructed a sequence G, of triangle-free graphs with ,y(G,) = n. In this article, w e calculate the fractional chromatic number of G, and show that this sequence of num

Hamiltonicity, diameter, domination, pac
Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
✍ David C. Fisher; Patricia A. McKenna; Elizabeth D. Boyer 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 785 KB

Let w(G), x(G), A(G), bp(G), diam(Gi), v(G), and y(G) be the clique number, chromatic number, adjacency matrix, biclique partition number, diameter, packing number, and domination number of a connected graph G. Mycielski constructed a graph g(G) with W@(G)) =w(G

Dependent edges in Mycielski graphs and
Dependent edges in Mycielski graphs and 4-colorings of 4-skeletons
✍ Karen L. Collins; Kimberly Tysdal 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 1 views

## Abstract A dependent edge in an acyclic orientation of a graph is one whose reversal creates a directed cycle. In answer to a question of Erdös, Fisher et al. [5] define __d__~min~(__G__) to be the minimum number of dependent edges of a graph __G__, where the minimum is taken over all acyclic or

The central ratio of a graph
The central ratio of a graph
✍ Fred Buckley 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 419 KB

We examine several graph equations involving the center, C(G), af a graph G. The central ratio of G, denoted c(G), is the ratio of jCCG,j to IV(G)(. We show that for any rat%?1 number r. where 0~ r s 1. there is a graph G with c(G) = r. For all such r, we describe a corresponding minimal graph. Grap