On the crossing numbers of Cartesian products of wheels and trees
From MaRDI portal
Publication:521759
DOI10.7151/dmgt.1957zbMath1359.05103OpenAlexW2583539467MaRDI QIDQ521759
Jana Petrillová, Matúš Valo, Marián Klešč
Publication date: 12 April 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1957
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)
Related Items (11)
Cyclic permutations in determining crossing numbers ⋮ DETERMINING CROSSING NUMBERS OF GRAPHS OF ORDER SIX USING CYCLIC PERMUTATIONS ⋮ The crossing number of \(K_{5,n+1} \setminus e\) ⋮ The crossing numbers of join products of four graphs of order five with paths and cycles ⋮ ON THE CROSSING NUMBER OF THE JOIN OF THE WHEEL ON FIVE VERTICES WITH THE DISCRETE GRAPH ⋮ The crossing number of Cartesian product of 5-wheel with any tree ⋮ Determining crossing number of join of the discrete graph with two symmetric graphs of order five ⋮ A survey of graphs with known or bounded crossing numbers ⋮ ON THE CROSSING NUMBER OF THE CARTESIAN PRODUCT OF A SUNLET GRAPH AND A STAR GRAPH ⋮ On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n} ⋮ The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The crossing number of \(P^2_n \square C_3\)
- On the crossing numbers of Cartesian products with paths
- On the crossing numbers of \(K_m\square C_n\) and \(K_{m,l}\square P_n\)
- A branch-and-cut approach to the crossing number problem
- The crossing numbers of join of the special graph on six vertices with path and cycle
- The crossing number of the Cartesian product of paths with complete graphs
- The crossing number of \(K_{1,4,n}\)
- The crossing numbers of join products of paths with graphs of order four
- [https://portal.mardi4nfdi.de/wiki/Publication:3156923 The crossing number ofCm �Cn is as conjectured forn ?m(m + 1)]
- The Join of Graphs and Crossing Numbers
- A New Approach to Exact Crossing Minimization
- The crossing number ofK1,3,n andK2,3,n
- On the parity of crossing numbers
- On the crossing numbers of products of cycles and graphs of order four
- The crossing numbers of products of paths and stars with 4‐vertex graphs
- 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 trees
- The crossing number of K5,n
- The crossing numbers of Cartesian products of paths with 5-vertex graphs
This page was built for publication: On the crossing numbers of Cartesian products of wheels and trees