Geodesic
The Crossing Number of The Hexagonal Graph H3,n
Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 2, pp. 547-554.

Voir la notice de l'article provenant de la source Library of Science

In [C. Thomassen, Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface, Trans. Amer. Math. Soc. 323 (1991) 605–635], Thomassen described completely all (except finitely many) regular tilings of the torus S1 and the Klein bottle N2 into (3,6)-tilings, (4,4)-tilings and (6,3)-tilings. Many authors made great efforts to investigate the crossing number (in the plane) of the Cartesian product of an m-cycle and an n-cycle, which is a special (4,4)-tiling. For other tilings, there are quite rare results concerning on their crossing numbers. This motivates us in the paper to determine the crossing number of a hexagonal graph H3,n, which is a special kind of (3,6)-tilings.
Keywords: hexagonal graph, Cartesian product, crossing number, drawing 
@article{DMGT_2019_39_2_a16,
     author = {Wang, Jing and Ouyang, Zhangdong and Huang, Yuanqiu},
     title = {The {Crossing} {Number} of {The} {Hexagonal} {Graph} {H\protect\textsubscript{3,n}}},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {547--554},
     publisher = {mathdoc},
     volume = {39},
     number = {2},
     year = {2019},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2019_39_2_a16/}
}
TY  - JOUR
AU  - Wang, Jing
AU  - Ouyang, Zhangdong
AU  - Huang, Yuanqiu
TI  - The Crossing Number of The Hexagonal Graph H3,n
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2019
SP  - 547
EP  - 554
VL  - 39
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2019_39_2_a16/
LA  - en
ID  - DMGT_2019_39_2_a16
ER  - 
%0 Journal Article
%A Wang, Jing
%A Ouyang, Zhangdong
%A Huang, Yuanqiu
%T The Crossing Number of The Hexagonal Graph H3,n
%J Discussiones Mathematicae. Graph Theory
%D 2019
%P 547-554
%V 39
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2019_39_2_a16/
%G en
%F DMGT_2019_39_2_a16
Wang, Jing; Ouyang, Zhangdong; Huang, Yuanqiu. The Crossing Number of The Hexagonal Graph H3,n. Discussiones Mathematicae. Graph Theory, Tome 39 (2019) no. 2, pp. 547-554. http://geodesic.mathdoc.fr/item/DMGT_2019_39_2_a16/

[1] J. Adamsson and R.B. Richter, Arrangements, circular arrangements and the crossing number of C7 × Cn, J. Combin. Theory Ser. B 90 (2004) 21–39. doi:10.1016/j.jctb.2003.05.001

[2] L.W. Beineke and R.D. Ringeisen, On the crossing numbers of products of cycles and graphs of order four, J. Graph Theory 4 (1980) 145–155. doi:10.1002/jgt.3190040203

[3] D. Bokal, On the crossing numbers of Cartesian products with paths, J. Combin. Theory Ser. B 97 (2007) 381–384. doi:10.1016/j.jctb.2006.06.003

[4] D. Bokal, On the crossing numbers of Cartesian products with trees, J. Graph Theory 56 (2007) 287–300. doi:10.1002/jgt.20258

[5] J.A. Bondy and U.S.R. Murty, Graph Theory (Springer, New York, 2008).

[6] M.R. Garey and D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (1983) 312–316. doi:10.1137/0604033

[7] M. Klešč, R.B. Ritcher and I. Stobert, The crossing number of C5 × Cn, J. Graph Theory 22 (1996) 239–243. doi:10.1002/(SICI)1097-0118(199607)22:3⟨239::AID-JGT4⟩3.0.CO;2-N

[8] D.J. Ma, H. Ren and J.J. Lu, The crossing number of the circular graph C (2 m + 2, m ), Discrete Math. 304 (2005) 88–93. doi:10.1016/j.disc.2005.04.018

[9] T.H. Pak, The crossing number of C (3 k + 1; {1, k }), Discrete Math. 307 (2007) 2771–2774. doi:10.1016/j.disc.2007.02.001

[10] R.B. Richter and G. Salazar, The crossing number of C6 × Cn, Australas. J. Combin. 23 (2001) 135–143.

[11] R.B. Richter and J. Širáň, The crossing number of K3,n in a surface, J. Graph Theory 21 (1996) 51–54. doi:10.1002/(SICI)1097-0118(199601)21:1⟨51::AID-JGT7⟩3.0.CO;2-L

[12] R.D. Ringeisen and L.W. Beineke, The crossing number of C3 × Cn, J. Combin. Theory Ser. B 24 (1978) 134–136. doi:10.1016/0095-8956(78)90014-X

[13] C. Thomassen, Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surface, Trans. Amer. Math. Soc. 323 (1991) 605–635. doi:10.1090/S0002-9947-1991-1040045-3

[14] Y.S. Yang, X.H. Lin, J.G. Lu and X. Hao, The crossing number of C (n; {1, 3}), Discrete Math. 289 (2004) 107–118. doi:10.1016/j.disc.2004.08.014