On the crossing numbers of Cartesian products of stars and paths or cycles
Marián Klešč (1991)
Mathematica Slovaca
Similarity:
Displaying similar documents to “On the crossing numbers of and ”
On the crossing numbers of Cartesian products of stars and paths or cycles
Characterizing families of cuts that can be represented by axis-parallel rectangles.
Brandes, Ulrik, Cornelsen, Sabine, Wagner, Dorothea (2005)
Journal of Graph Algorithms and Applications
Similarity:
On -Pancyclic Graphs
Vasil Jacoš (1975)
Matematický časopis
Similarity:
A problem concerning -pancyclic graphs
Vasil Jacoš, Stanislav Jendroľ (1974)
Matematický časopis
Similarity:
Clustering cycles into cycles of clusters.
Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)
Journal of Graph Algorithms and Applications
Similarity:
Geodetic topological cycles in locally finite graphs.
Georgakopoulos, Agelos, Sprussel, Philipp (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The crossing numbers of products of a 5-vertex graph with paths and cycles
Marián Klešč (1999)
Discussiones Mathematicae Graph Theory
Similarity:
There are several known exact results on the crossing numbers of Cartesian products of paths, cycles or stars with "small" graphs. Let H be the 5-vertex graph defined from K₅ by removing three edges incident with a common vertex. In this paper, we extend the earlier results to the Cartesian products of H × Pₙ and H × Cₙ, showing that in the general case the corresponding crossing numbers are 3n-1, and 3n for even n or 3n+1 if n is odd.