On the crossing numbers of Cartesian products of wheels and trees
From MaRDI portal
(Redirected from Publication:521759)
Recommendations
Cites work
- scientific article; zbMATH DE number 3803471 (Why is no real title available?)
- scientific article; zbMATH DE number 3446923 (Why is no real title available?)
- scientific article; zbMATH DE number 5257387 (Why is no real title available?)
- A New Approach to Exact Crossing Minimization
- A branch-and-cut approach to the crossing number problem
- An ILP-based Proof System for the Crossing Number Problem
- Experiments on exact crossing minimization using column generation
- On the crossing numbers of Cartesian products with paths
- On the crossing numbers of Cartesian products with trees
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
- On the crossing numbers of products of cycles and graphs of order four
- On the parity of crossing numbers
- The Join of Graphs and Crossing Numbers
- The crossing number of K5,n
- The crossing number of \(K_{1,4,n}\)
- The crossing number of \(P^2_n \square C_3\)
- The crossing number of the Cartesian product of paths with complete graphs
- The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)
- The crossing number ofK1,3,n andK2,3,n
- The crossing numbers of Cartesian products of paths with 5-vertex 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
Cited in
(16)- A survey of graphs with known or bounded crossing numbers
- The crossing number of Cartesian product of 5-wheel with any tree
- The crossing numbers of join products of four graphs of order five with paths and cycles
- Determining crossing number of join of the discrete graph with two symmetric graphs of order five
- The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
- On the crossing numbers of Cartesian products of small graphs with paths, cycles and stars
- On the crossing number of the join of the wheel on five vertices with the discrete graph
- On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\)
- On the crossing number of the Cartesian product of a sunlet graph and a star graph
- Cyclic permutations in determining crossing numbers
- The influence of separating cycles in drawings of \(K_5 \setminus e\) in the join product with paths and cycles
- DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS
- On the brush number of the Cartesian product of tree with path or cycle
- The crossing number of \(K_{5,n+1} \setminus e\)
- Disconnected spanning subgraphs of paths in the join products with cycles
- On the crossing numbers of Cartesian products with trees
This page was built for publication: On the crossing numbers of Cartesian products of wheels and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q521759)