The crossing number of the hexagonal graph \(H_{3,n}\)
From MaRDI portal
Publication:1717209
DOI10.7151/DMGT.2092zbMath1404.05038OpenAlexW2804785220MaRDI QIDQ1717209
Jing Wang, Zhang Dong Ouyang, Yuan Qiu Huang
Publication date: 7 February 2019
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2092
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 (3)
Nonplanarity of iterated line graphs ⋮ A survey of graphs with known or bounded crossing numbers ⋮ The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane
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\)
- Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\).
- The crossing number of \(C(n; \{1,3\})\)
- The crossing number of \(C(3k+1;\{1,k\})\)
- The crossing number of the circular graph \(C(2m+2,m)\)
- Crossing Number is NP-Complete
- On the crossing numbers of products of cycles and graphs of order four
- [https://portal.mardi4nfdi.de/wiki/Publication:4888117 The crossing number ofC5 �Cn]
- On the crossing numbers of Cartesian products with trees
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
This page was built for publication: The crossing number of the hexagonal graph \(H_{3,n}\)