Disconnected spanning subgraphs of paths in the join products with cycles

DOI10.26493/2590-9770.1540.7B1zbMATH Open1537.05006MaRDI QIDQ6540221FDOQ6540221

Michal Staš, Mária Švecová

Publication date: 15 May 2024

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

cyclespanning subgraphpathcrossing numberoptimal drawingjoin product

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Cites Work

• Crossing Number is NP-Complete
• 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
• On the crossing numbers of Cartesian products of wheels and trees
• The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle
• Cyclic permutations in determining crossing numbers
• A survey of graphs with known or bounded crossing numbers
• On the crossing numbers of join products of W_{4}+P_{n} and W_{4}+C_{n}
• ON PROBLEMS OF -CONNECTED GRAPHS FOR

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)