Antiparallel \(d\)-stable traces and a stronger version of ore problem (Q2014350): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: ALGEBRAIC CHARACTERIZATIONS OF GRAPH IMBEDDABILITY IN SURFACES AND PSEUDOSURFACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the surface duality of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented walk double covering and bidirectional double tracing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Traces Model of Self-Assembly Polypeptide Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5408288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5762903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Detachments of Graphs and Generalized Euler Trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amalgamations of almost regular edge-colourings of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem regarding the tracing of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional retracting-free double tracings and upper embeddability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Traversing Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly traversed Euler circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper-embeddable graphs and related topics / rank
 
Normal rank

Revision as of 05:42, 14 July 2024

scientific article
Language Label Description Also known as
English
Antiparallel \(d\)-stable traces and a stronger version of ore problem
scientific article

    Statements

    Antiparallel \(d\)-stable traces and a stronger version of ore problem (English)
    0 references
    0 references
    11 August 2017
    0 references
    double trace
    0 references
    \(d\)-stable trace
    0 references
    strong trace
    0 references
    single face embedding
    0 references
    spanning tree
    0 references
    self-assembling
    0 references
    polypeptide nanostructure
    0 references
    strands of DNA
    0 references

    Identifiers

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