Two recursive inequalities for crossing numbers of graphs

DOI10.1007/S11464-016-0618-8MaRDI QIDQ2358375zbMATH OpenOpenAlexFDO

Authors Zhangdong Ouyang, Jing Wang, Yuanqiu Huang

Publication date 14 June 2017

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-016-0618-8

zbMATH Keywords

crossing numbergraph drawingrecursive inequality

Mathematics Subject Classification ID

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

Recommendations

• Bounds for rectilinear crossing numbers
• The crossing number ofK1,3,n andK2,3,n
• A survey of graphs with known or bounded crossing numbers
• A better bound for the pair-crossing number
• scientific article; zbMATH DE number 1894431

Cites work

• A successful concept for measuring non-planarity of graphs: The crossing number.
• Computing crossing numbers in quadratic time
• Crossing number is hard for cubic graphs
• Crossing Number is NP-Complete
• Graph theory with applications
• The crossing number of K5,n
• The crossing number ofK1,3,n andK2,3,n

Cited in

(4)

• The crossing number of \(K_{5,n+1} \setminus e\)
• On the average crosscap number. II: Bounds for a graph
• scientific article; zbMATH DE number 1894431 (Why is no real title available?)
• Different types of isomorphisms of drawings of complete multipartite graphs

This page was built for publication: Two recursive inequalities for crossing numbers of graphs

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