Back to Search
Start Over
The Crossing Number of Cartesian Products of Complete Bipartite Graphs K 2, m with Paths P n .
- Source :
- Graphs & Combinatorics; Dec2007, Vol. 23 Issue 6, p659-666, 8p, 4 Diagrams
- Publication Year :
- 2007
-
Abstract
- Most results on the crossing number of a graph focus on the special graphs, such as Cartesian products of small graphs with paths P <subscript> n </subscript>, cycles C <subscript> n </subscript> or stars S <subscript> n </subscript>. In this paper, we extend the results to Cartesian products of complete bipartite graphs K <subscript>2, m </subscript> with paths P <subscript> n </subscript> for arbitrary m ≥ 2 and n ≥ 1. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 23
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 27768136
- Full Text :
- https://doi.org/10.1007/s00373-007-0761-9