Crossing numbers of graphs with rotation systems (Q548653): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-009-9343-y / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4484775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bimodal Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4153936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing number is hard for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of the String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a cyclic string-to-string correction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which crossing number is it anyway? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing even crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Even Crossings on Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd crossing number and crossing number are not the same / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Independently Even Crossings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing string graphs in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A successful concept for measuring non-planarity of graphs: The crossing number. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimality criterion for the crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a theory of crossing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133128 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-009-9343-Y / rank
 
Normal rank

Latest revision as of 21:12, 9 December 2024

scientific article
Language Label Description Also known as
English
Crossing numbers of graphs with rotation systems
scientific article

    Statements

    Crossing numbers of graphs with rotation systems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    crossing number
    0 references
    rotation system
    0 references
    odd crossing number
    0 references
    independent odd crossing number
    0 references
    tournaments
    0 references
    NP-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references