Planar tanglegram layouts and single edge insertion (Q6103811): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Analogies between the crossing number and the tangle crossing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the enumeration of tanglegrams and tangled chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Drawing (complete) binary tanglegrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tanglegram Kuratowski theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing trees via crossing minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing Number is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting tanglegrams with species / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inserting an edge into a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shape of random tanglegrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: The On-Line Encyclopedia of Integer Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993554 / rank
 
Normal rank

Latest revision as of 06:37, 1 August 2024

scientific article; zbMATH DE number 7692136
Language Label Description Also known as
English
Planar tanglegram layouts and single edge insertion
scientific article; zbMATH DE number 7692136

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references