The crossing number of K₅,n+1 e

DOI10.1016/J.AMC.2020.125075MaRDI QIDQ2177670zbMATH OpenOpenAlexFDO

Authors Yuanqiu Huang, Yu-Xi Wang

Publication date 6 May 2020

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2020.125075

zbMATH Keywords

complete bipartite graphcrossing numbergraph drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• scientific article; zbMATH DE number 7365804
• Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.
• The crossing number of \(K_{2, 2, 2, n}\)
• The crossing number of \(K_{1,1,3,n}\).
• On the crossing numbers of K₅ S_n

Cites work

• A note on the parity of the number of crossings of a graph
• A successful concept for measuring non-planarity of graphs: The crossing number.
• Crossing Number is NP-Complete
• Crossing Number Problems
• Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• scientific article; zbMATH DE number 1452728 (Why is no real title available?)
• scientific article; zbMATH DE number 3803471 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Improvement on the Decay of Crossing Numbers
• Infinite families of crossing-critical graphs with prescribed average degree and crossing number
• Minimal graphs with crossing number at least \(k\)
• On a crossing number result of Richter and Thomassen
• On a problem of P. Turan concerning graphs
• On the crossing numbers of Cartesian products of wheels and trees
• On the crossing numbers of Cartesian products with paths
• On the crossing numbers of products of cycles and graphs of order four
• On the decay of crossing numbers
• The crossing number of K₁₁ is 100
• The crossing number of K5,n
• The crossing number of the Cartesian product of paths with complete graphs
• The crossing numbers of join of the special graph on six vertices with path and cycle
• The crossing numbers of join products of paths with graphs of order four
• The crossing numbers of products of paths and stars with 4‐vertex graphs
• The Join of Graphs and Crossing Numbers
• Two recursive inequalities for crossing numbers of graphs
• Zarankiewicz's conjecture is finite for each fixed \(m\)

Cited in

(8)

• Crossing numbers of nearly complete graphs and nearly complete bipartite graphs.
• The crossing number of P^2_5 C_n
• scientific article; zbMATH DE number 2156833 (Why is no real title available?)
• scientific article; zbMATH DE number 7365804 (Why is no real title available?)
• On Numerical Invariant of Graph
• scientific article; zbMATH DE number 5584096 (Why is no real title available?)
• scientific article; zbMATH DE number 7071327 (Why is no real title available?)
• The crossing number of nearly complete bipartite graphs

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

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