The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\)
From MaRDI portal
Publication:2478173
DOI10.1007/s00373-007-0761-9zbMath1141.05030MaRDI QIDQ2478173
Tang Ling, Lv Shengxiang, Huang Yuanqiu
Publication date: 14 March 2008
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0761-9
05C10: Planar graphs; geometric and topological aspects of graph theory
Cites Work
- On the crossing numbers of Cartesian products with paths
- [https://portal.mardi4nfdi.de/wiki/Publication:3156923 The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)]
- Crossing Number is NP-Complete
- The crossing number of K5,n
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item