On the crossing numbers of products of stars and graphs of order five (Q5943048): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s003730170042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966749070 / rank
 
Normal rank

Latest revision as of 03:14, 20 March 2024

scientific article; zbMATH DE number 1642136
Language Label Description Also known as
English
On the crossing numbers of products of stars and graphs of order five
scientific article; zbMATH DE number 1642136

    Statements

    On the crossing numbers of products of stars and graphs of order five (English)
    0 references
    0 references
    0 references
    8 January 2002
    0 references
    Although there are a number of exact results on the crossing number of some particular kinds of graphs including Cartesian products of paths or circuits with some specific smaller graphs, the problem of determining the exact crossing number of a graph is extremely hard in general. This paper provides the exact crossing number of the Cartesian product of two specific graphs: one is a graph of order 5 and the other is a path of order \(n+1\).
    0 references
    0 references
    0 references
    stars
    0 references
    product
    0 references
    crossing number
    0 references
    path
    0 references
    0 references