The crossing number ofC5 �Cn
From MaRDI portal
Publication:4888117
DOI<239::AID-JGT4>3.0.CO;2-N 10.1002/(SICI)1097-0118(199607)22:3<239::AID-JGT4>3.0.CO;2-NzbMath0854.05036OpenAlexW2212201998MaRDI QIDQ4888117
Marián Klešč, Ian Stobert, R. Bruce Richter
Publication date: 15 October 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199607)22:3<239::aid-jgt4>3.0.co;2-n
Related Items (15)
Unnamed Item ⋮ The crossing numbers of products of 5-vertex graphs with cycles ⋮ k-Quasi-Planar Graphs ⋮ A successful concept for measuring non-planarity of graphs: The crossing number. ⋮ The crossing number of the hexagonal graph \(H_{3,n}\) ⋮ Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\). ⋮ The crossing number of \(K_{1,4,n}\) ⋮ Crossing number is hard for cubic graphs ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:4521491 A lower bound for the crossing number ofCm � Cn] ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ General lower bounds for the minor crossing number of graphs ⋮ A survey of graphs with known or bounded crossing numbers ⋮ The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane ⋮ Drawings of \(C_m\times C_n\) with one disjoint family. II ⋮ Drawings of \(C_m\times C_n\) with one disjoint family
This page was built for publication: The crossing number ofC5 �Cn