Drawings of C_m C_n with one disjoint family

DOI10.1006/JCTB.1998.1890zbMATH Open0935.05038OpenAlexW2267776933MaRDI QIDQ1306302FDOQ1306302

Authors: Gelasio Salazar 

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1890

Recommendations

• Drawings of \(C_m\times C_n\) with one disjoint family. II
• On the crossing number ofcm �cn
• The crossing number of \(C_6\times C_n\)
• An improved bound for the crossing number of \(C_m\times C_n\): a self-contained proof using mostly combinatorial arguments

zbMATH Keywords

crossing numberdrawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Cites Work

• The crossing number ofC5 �Cn
• The crossing number of \(C_3\times C_n\)
• On the crossing numbers of products of cycles and graphs of order four
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal graphs with crossing number at least \(k\)
• Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)

Cited In (3)

• Arrangements, circular arrangements and the crossing number of \(C_{7} \times C_{n}\).
• Drawings of \(C_m\times C_n\) with one disjoint family. II
• The crossing number ofC5 �Cn

This page was built for publication: Drawings of \(C_m\times C_n\) with one disjoint family

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306302)