Disconnected spanning subgraphs of paths in the join products with cycles
From MaRDI portal
Publication:6540221
Recommendations
- 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
- The crossing numbers of join products of paths with three graphs of order five
- The influence of separating cycles in drawings of K₅ e in the join product with paths and cycles
- On the crossing number of the join product of a path and a graph of order six
Cites work
- A survey of graphs with known or bounded crossing numbers
- Crossing Number is NP-Complete
- Cyclic permutations in determining crossing numbers
- [[:Publication:4959262|On problems of \(\mathcal{CF}\)-connected graphs for \({K}_Template:M,n \)]]
- On the crossing numbers of Cartesian products of wheels and trees
- On the crossing numbers of join products of \(W_4+P_n\) and \(W_4+C_n\)
- The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
- The crossing number of K5,n
- The crossing numbers of join of the special graph on six vertices with path and cycle
- The Join of Graphs and Crossing Numbers
Cited in
(2)
This page was built for publication: Disconnected spanning subgraphs of paths in the join products with cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540221)