A lower bound for the crossing number ofCm � Cn

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200011)35:3<222::AID-JGT7>3.0.CO;2-E" /><222::AID-JGT7>3.0.CO;2-E 10.1002/1097-0118(200011)35:3<222::AID-JGT7>3.0.CO;2-EzbMath0959.05063OpenAlexW4256119934MaRDI QIDQ4521491

Gelasio Salazar

Publication date: 20 April 2001

Full work available at URL: https://doi.org/10.1002/1097-0118(200011)35:3<222::aid-jgt7>3.0.co;2-e

zbMATH Keywords

crossing numberCartesian product

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Unnamed Item ⋮ A survey of graphs with known or bounded crossing numbers

Cites Work

• 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
• On the crossing numbers of products of cycles and graphs of order four
• The crossing number of c₄ × c₄
• [https://portal.mardi4nfdi.de/wiki/Publication:4888117 The crossing number ofC5 �Cn]
• Crossing Number Problems

This page was built for publication: A lower bound for the crossing number ofCm � Cn