Zip product of graphs and crossing numbers
From MaRDI portal
Publication:6055394
DOI10.1002/jgt.22613zbMath1521.05171OpenAlexW3043540142WikidataQ114236153 ScholiaQ114236153MaRDI QIDQ6055394
Fengming Dong, Eng Guan Tay, Zhang Dong Ouyang, Yuan Qiu Huang
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22613
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the crossing numbers of Cartesian products with paths
- The crossing number of \(C_3\times C_n\)
- Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
- Intersection of curves and crossing number of \(C_m\times C_n\) on surfaces
- Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\).
- The crossing number of \(K_{1,4,n}\)
- The crossing numbers of join products of paths with graphs of order four
- [https://portal.mardi4nfdi.de/wiki/Publication:3156923 The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)]
- Crossing Number is NP-Complete
- On the crossing number of some complete multipartite graphs
- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices
- On the crossing numbers of products of cycles and graphs of order four
- The crossing numbers of products of paths and stars with 4‐vertex graphs
- On the crossing numbers of Cartesian products with trees
- The crossing number of K5,n
- Crossing Number Problems
- The crossing numbers of Cartesian products of paths with 5-vertex graphs
This page was built for publication: Zip product of graphs and crossing numbers
