The crossing number of \(K_{1,m,n}\)

DOI10.1016/j.disc.2007.11.023zbMath1168.05018OpenAlexW1483838862MaRDI QIDQ998333

Pak Tung Ho

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.023

zbMATH Keywords

crossing numbermultipartite graphsZarankiewicz's conjecture

Mathematics Subject Classification ID

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

Related Items (8)

The crossing numbers of join of some graphs with \(n\) isolated vertices ⋮ On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs ⋮ The crossing number of Cartesian product of 5-wheel with any tree ⋮ Unnamed Item ⋮ The crossing numbers of join of the special graph on six vertices with path and cycle ⋮ The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds ⋮ A survey of graphs with known or bounded crossing numbers ⋮ On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n}

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework for solving VLSI graph layout problems
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Crossing number is hard for cubic graphs
• Crossing Number is NP-Complete
• On the crossing number of some complete multipartite graphs
• The crossing number ofK1,3,n andK2,3,n
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• The crossing number of K₁₁ is 100
• The crossing number of K5,n
• Über die Kreuzungszahl vollständiger, n‐geteilter Graphen

This page was built for publication: The crossing number of \(K_{1,m,n}\)