Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Petr Hlinený. Crossing number is hard for cubic graphs. Journal of Combinatorial Theory, Series A, 96(4):455-471, 2006. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Crossing Number Is Hard for Cubic GraphsPetr Hlinený. mfcs 2004: 772-782 [doi] Crossing Number is Hard for KernelizationPetr Hlinený, Marek Dernár. compgeom 2016: [doi]
The following publications are possibly variants of this publication: