Enumerations of the maximum rectilinear crossing numbers of complete and complete multi-partite graphs

DOI10.1080/09720529.2006.10698101zbMath1123.05030OpenAlexW2032971796MaRDI QIDQ5307758

Voon Chet Koo, Che Sheng Gan

Publication date: 18 September 2007

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2006.10698101

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Crossing Number is NP-Complete

This page was built for publication: Enumerations of the maximum rectilinear crossing numbers of complete and complete multi-partite graphs