On the crossing numbers of Cartesian products with paths

• Autores: Drago Bokal
• Localización: Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 97, Nº. 3, 2007, págs. 381-384
• Idioma: inglés
• DOI: 10.1016/j.jctb.2006.06.003
• Texto completo no disponible (Saber más ...)
• Resumen

  • Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the conjecture of Jendrol' and ¿cerbová from 1982 about the crossing number of the Cartesian product K1,m?Pn. Our approach is applicable to the capped Cartesian products of Pn with any graph containing a dominating vertex.