✦ LIBER ✦
Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
✍ Scribed by David C. Fisher; Patricia A. McKenna; Elizabeth D. Boyer
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 785 KB
- Volume
- 84
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
✦ Synopsis
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