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.635zbMath1492.05135OpenAlexW4285166709MaRDI QIDQ5089904
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
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The optimal drawings of \(K_{5,n}\)
- The crossing numbers of join of the special graph on six vertices with path and cycle
- 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
- The crossing numbers of join products of paths with graphs of order four
- Crossing Number is NP-Complete
- On the crossing number of join of the wheel on six vertices with the discrete graph
- The Join of Graphs and Crossing Numbers
- Cyclic‐order graphs and Zarankiewicz's crossing‐number conjecture
- 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}
- A survey of graphs with known or bounded crossing numbers
- The crossing number of K5,n
- The crossing numbers of Cartesian products of paths with 5-vertex graphs
This page was built for publication: The crossing numbers of join products of paths with three graphs of order five