On the Minimum Cut of Planarizations (Q3439582): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56977267, #quickstatements; #temporary_batch_1710976035288
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments on Exact Crossing Minimization Using Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimum Cut of Planarizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additivity of the crossing number of graphs with connectivity 2 / rank
 
Normal rank

Latest revision as of 19:11, 25 June 2024

scientific article
Language Label Description Also known as
English
On the Minimum Cut of Planarizations
scientific article

    Statements

    On the Minimum Cut of Planarizations (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    crossing number
    0 references
    minimum cut
    0 references
    graph planarization
    0 references

    Identifiers