The crossing numbers of Cartesian products of paths with 5-vertex graphs
✍ Scribed by Marián Klešč
- Book ID
- 108315544
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 122 KB
- Volume
- 233
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract Zip product was recently used in a note establishing the crossing number of the Cartesian product __K__~1~,__n__ □ __P__~m~. In this article, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding metho
In the paper we obtain some conditions under which the binding number bind (C) of a Cartesian product graph G is equal to The concept of the binding number of a graph was introduced by Woodall in 1973 . The main theorem of Woodall's paper is a sufficient condition for the existence of a Hamiltonian