The crossing numbers of join products of four graphs of order five with paths and cycles
From MaRDI portal
Publication:6137692
DOI10.7494/OPMATH.2023.43.6.865zbMATH Open1520.05083OpenAlexW4387996126MaRDI QIDQ6137692FDOQ6137692
Authors: Michal Staš, Mária Timková
Publication date: 4 September 2023
Published in: Opuscula Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7494/opmath.2023.43.6.865
Recommendations
- The crossing numbers of join products of paths with three graphs of order five
- The crossing numbers of join products of eight graphs of order six with paths and cycles
- The crossing numbers of join of path and cycle with a special graph of order six.
- The crossing numbers of join products of paths with graphs of order four
- The crossing number of the join product of \({K_{1,1,1,2}} + {P_n}\)
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- The graph crossing number and its variants: a survey
- 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
- An ILP-based Proof System for the Crossing Number Problem
- On the crossing numbers of Cartesian products of wheels and trees
- On crossing numbers of complete tripartite and balanced complete multipartite graphs
- On the 2-colored crossing number
- The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
- The crossing numbers of join of special disconnected graph on five vertices with discrete graphs
- Cyclic permutations in determining crossing numbers
- On the crossing numbers of Cartesian products of paths with special graphs
- A survey of graphs with known or bounded crossing numbers
- The crossing number of \(K_{1,1,3,n}\).
- On the crossing number of join of the wheel on six vertices with the discrete graph
- On the crossing numbers of the join products of five graphs on six vertices with discrete graph
- On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\)
- The crossing numbers of join products of paths with three graphs of order five
- Title not available (Why is that?)
- Title not available (Why is that?)
- The crossing numbers of join products of eight graphs of order six with paths and cycles
- The crossing numbers of join products of four graphs of order five with paths and cycles
Cited In (14)
- The crossing numbers of join products of paths with three graphs of order five
- The crossing numbers of join products of four graphs of order five with paths and cycles
- The crossing numbers of join products of paths with graphs of order four
- The crossing numbers of join of path and cycle with a special graph of order six.
- The Join of Graphs and Crossing Numbers
- On the crossing number of the join product of a path and a graph of order six
- On the crossing numbers of join products of four graphs of order six with the discrete graph
- The crossing numbers of join of a subdivision of \({K_{2,3}}\) with \({P_n}\) and \({C_n}\)
- 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 \({C_6}+3{K_2}\) with \({P_n}\) and \({C_n}\)
- 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
This page was built for publication: The crossing numbers of join products of four graphs of order five with paths and cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137692)