The crossing numbers of join products of paths with three graphs of order five
From MaRDI portal
Publication:5089904
DOI10.7494/OPMATH.2022.42.4.635zbMATH Open1492.05135OpenAlexW4285166709MaRDI QIDQ5089904FDOQ5089904
Authors: Michal Staš, Mária Švecová
Publication date: 15 July 2022
Published in: Opuscula Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7494/opmath.2022.42.4.635
Recommendations
- The crossing numbers of join products of four graphs of order five with paths and cycles
- On the crossing number of join product of the discrete graph with special graphs of order five
- On the crossing numbers of join products of five graphs of order six with the discrete graph
- Determining crossing number of join of the discrete graph with two symmetric graphs of order five
- The crossing numbers of join products of eight graphs of order six with paths and cycles
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Crossing Number is NP-Complete
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- The crossing number of K5,n
- The crossing numbers of join of the special graph on six vertices with path and cycle
- The optimal drawings of \(K_{5,n}\)
- The crossing numbers of join products of paths with graphs of order four
- The Join of Graphs and Crossing Numbers
- The crossing numbers of Cartesian products of paths with 5-vertex graphs
- The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
- Determining crossing number of join of the discrete graph with two symmetric graphs of order five
- Cyclic permutations and crossing numbers of join products of two symmetric graphs of order six
- On the crossing numbers of Cartesian products of paths with special graphs
- A survey of graphs with known or bounded crossing numbers
- On the crossing number of join of the wheel on six vertices with the discrete graph
- On the crossing number of join product of the discrete graph with special graphs of order five
- On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\)
- Title not available (Why is that?)
Cited In (15)
- On the crossing number of join product of the discrete graph with special graphs of order five
- The crossing numbers of join products of four graphs of order five with paths and cycles
- On the crossing number of the join of some 5-vertex graphs and \(P_n\)
- 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
- The crossing numbers of join products of paths with graphs of order four
- On the crossing number of the join product of a path and a graph of order six
- Title not available (Why is that?)
- The crossing numbers of join of some graphs with \(n\) isolated vertices
- The influence of separating cycles in drawings of \(K_5 \setminus e\) in the join product with paths and cycles
- The crossing number of the join product of \({K_{1,1,1,2}} + {P_n}\)
- The crossing numbers of join products of eight graphs of order six with paths and cycles
- Disconnected spanning subgraphs of paths in the join products with cycles
- The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
- On the crossing numbers of join products of five graphs of order six with the discrete graph
This page was built for publication: The crossing numbers of join products of paths with three graphs of order five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089904)