On the Crossing Numbers of Products of Stars and Graphs of Order Five
✍ Scribed by Marián Klešč
- Publisher
- Springer Japan
- Year
- 2001
- Tongue
- English
- Weight
- 111 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this communication the domination number of the cross product of an elementary path with the complement of another path is exactly determined and some inequalities for general cases are deduced. The paper ends with a Vizing-like conjecture relating the domination number of the cross product of G
## Abstract The __crossing number__, cr(__G__), of a graph __G__ is the least number of crossing points in any drawing of __G__ in the plane. According to the Crossing Lemma of M. Ajtai, V. Chvátal, M. Newborn, E. Szemerédi, Theory and Practice of Combinatorics, North‐Holland, Amsterdam, New York,
## Abstract The star‐chromatic number of a graph, a concept introduced by Vince, is natural generalization of the chromatic number of a graph. We point out an alternate definition of the star‐chromatic number, which sheds new light on the relation of the star‐chromatic number and the ordinary chrom
In his paper on the crossing numbers of generalized Petersen graphs, Fiorini proves that P(8, 3) has crossing number 4 and claims at the end that P(10, 3) also has crossing number 4. In this article, we give a short proof of the first claim and show that the second claim is false. The techniques are