The crossing number of Knödel graph W₃,n

zbMATH Open1161.05029MaRDI QIDQ3513962FDOQ3513962

Authors: Zheng Wenping, Lin Xiaohui, Yuansheng Yang, Deng Chengrui 

Publication date: 21 July 2008

Recommendations

• A survey on Knödel graphs.
• The crossing number of \(C(mk;\{1,k\})\)
• Some properties of the Knödel graph \(W(k,2^k)\), \(k\geq 4\)
• On the minimum path problem in Knödel graphs
• The crossing number ofK1,3,n andK2,3,n

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Communication networks in operations research (90B18)

Cited In (2)

• The crossing number of chordal ring networks
• A survey of graphs with known or bounded crossing numbers

This page was built for publication: The crossing number of Knödel graph \(W_{3,n}\)

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