On the crossing numbers of Cartesian products with paths (Q875940): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2006.06.003 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2006.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999834983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the crossing numbers of products of cycles and graphs of order four / 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: Q4748171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of K5,n / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4018745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of \(K_{2,3}{\times}C_{3}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The crossing number of \(C_3\times C_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite families of crossing-critical graphs with given average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856672 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTB.2006.06.003 / rank
 
Normal rank

Latest revision as of 06:28, 10 December 2024

scientific article
Language Label Description Also known as
English
On the crossing numbers of Cartesian products with paths
scientific article

    Statements

    On the crossing numbers of Cartesian products with paths (English)
    0 references
    0 references
    16 April 2007
    0 references
    crossing number
    0 references
    Cartesian product
    0 references
    path
    0 references
    graph drawings
    0 references

    Identifiers