The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) (Q2478173): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Arthur T. White / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Arthur T. White / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-007-0761-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2333310721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the crossing numbers of Cartesian products with paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of K5,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number ofCm �Cn is as conjectured forn ?m(m + 1) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4018745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3609053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5456330 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:40, 27 June 2024

scientific article
Language Label Description Also known as
English
The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\)
scientific article

    Statements

    The crossing number of Cartesian products of complete bipartite graphs \(K_{2,m}\) with paths \(P_{n}\) (English)
    0 references
    0 references
    0 references
    0 references
    14 March 2008
    0 references
    The authors show that: \(\text{cr}(K_{2,m}\times P_n)= 2n\lfloor m/2\rfloor\lfloor(m -1)/2\rfloor\), for all \(m\geq 2\) and \(n\geq 1\).
    0 references
    0 references
    crossing number
    0 references
    complete bipartite graph
    0 references
    path
    0 references
    Cartesian products
    0 references
    0 references