Conjectures about wheels without one edge

DOI10.37193/CJM.2025.01.04MaRDI QIDQ6963284zbMATH OpenFDO

Authors Štefan Berežný, Michal Staš

Publication date 7 July 2025

Published in Carpathian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37193/CJM.2025.01.04

zbMATH Keywords

crossing numbercyclediscrete graphgraph drawingjoin productstarwheel

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62) Graph operations (line graphs, products, etc.) (05C76)

Cites work

• A survey of graphs with known or bounded crossing numbers
• An ILP-based Proof System for the Crossing Number Problem
• Crossing Number is NP-Complete
• Crossing numbers of \(K_{1,1,4,n}\) and \(K_{1,1,4}\square T\).
• Cyclic permutations in determining crossing numbers
• Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
• DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
• scientific article; zbMATH DE number 6008469 (Why is no real title available?)
• scientific article; zbMATH DE number 6260141 (Why is no real title available?)
• scientific article; zbMATH DE number 5257387 (Why is no real title available?)
• [[:Publication:4959262|On problems of \(\mathcal{CF}\)-connected graphs for \({K}_Template:M,n \)]]
• On the crossing number of join of the wheel on six vertices with the discrete graph
• On the crossing number of some complete multipartite graphs
• On the crossing number of the Cartesian product of a 6-vertex graph with S_n
• On the crossing numbers of Cartesian products of stars and graphs of order six
• On the crossing numbers of Cartesian products of stars and graphs on five vertices
• On the crossing numbers of join products of five graphs of order six with the discrete graph
• On the crossing numbers of products of stars and graphs of order five
• On the crossing numbers of the join products of five graphs on six vertices with discrete graph
• The conjecture on the crossing number of \(K_{1, m, n}\) is true if Zarankiewicz's conjecture holds
• The crossing number of \(K_{1,1,3,n}\).
• The crossing number of \(K_{1,4,n}\)
• The crossing number of \(K_{1,m,n}\)
• The crossing number of \(K_{2, 2, 2, n}\)
• The crossing number of Cartesian product of 5-wheel with any tree
• The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
• The crossing number of K5,n
• The crossing number ofK1,3,n andK2,3,n
• The crossing numbers of join of some graphs with n isolated vertices
• The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
• The crossing numbers of join of the special graph on six vertices with path and cycle
• The crossing numbers of join products of eight graphs of order six with paths and cycles
• The crossing numbers of join products of paths with graphs of order four
• The Join of Graphs and Crossing Numbers
• The optimal drawings of \(K_{5,n}\)
• Über die Kreuzungszahl vollständiger, n‐geteilter Graphen

This page was built for publication: Conjectures about wheels without one edge

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