ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH
From MaRDI portal
Publication:4968453
DOI10.1017/S0004972719000091zbMath1416.05241arXiv1902.10357OpenAlexW2911926795MaRDI QIDQ4968453
Alex Newcombe, Michael Haythorpe
Publication date: 12 July 2019
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.10357
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The crossing number of \(P^2_n \square C_3\)
- On the crossing number of \(K_{13}\)
- On the crossing numbers of Cartesian products of wheels and trees
- On the crossing numbers of Cartesian products with paths
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
- The crossing number of \(C_3\times C_n\)
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- An effective crossing minimisation heuristic based on star insertion
- [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 ofK1,3,n andK2,3,n
- On the crossing numbers of products of cycles and graphs of order four
- The crossing number of c4 × c4
- An ILP-based Proof System for the Crossing Number Problem
- Adding One Edge to Planar Graphs Makes Crossing Number and 1-Planarity Hard
This page was built for publication: ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH