Crossing number of the complete tripartite graph K₁,10,n

MaRDI QIDQ5319059zbMATH OpenFDO

Authors Jing Wang, Yuanqiu Huang

Publication date 22 July 2009

zbMATH Keywords

complete bipartite graphcomplete tripartite graphcrossing number

Mathematics Subject Classification ID

Perfect graphs (05C17) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• On the crossing number of the complete tripartite graph \(K_{1,8,n}\)
• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• The crossing number of \(K_{1,m,n}\)
• A lower bound on the crossing number of the complete tripartite graph \(K_{1,2p+1,2q+1}\).
• scientific article; zbMATH DE number 2156833

Cited in

(12)

• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• On crossing numbers of complete tripartite and balanced complete multipartite graphs
• On the crossing number of the complete tripartite graph \(K_{1,8,n}\)
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• The crossing number of the complete 4-partite graph \(K_{1,3,3,n}\)
• On the crossing number for Kronecker product of a tripartite graph with path
• A lower bound on the crossing number of the complete tripartite graph \(K_{1,2p+1,2q+1}\).
• A survey of graphs with known or bounded crossing numbers
• The crossing number of \(K_{3,3,n}\)
• On the crossing numbers of W₆ S_n
• The crossing number of nearly complete bipartite graphs
• The crossing number of \(K_{1,m,n}\)

This page was built for publication: Crossing number of the complete tripartite graph \(K_{1,10,n}\)

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