Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits (Q442349): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Normalize DOI.
Property / DOI
 
Property / DOI: 10.1016/j.disc.2012.04.013 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2012.04.013 / rank
 
Normal rank

Revision as of 01:44, 9 December 2024

scientific article
Language Label Description Also known as
English
Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits
scientific article

    Statements

    Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits (English)
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    rigidity circuits
    0 references
    edge-disjoint Hamiltonian paths
    0 references
    medial graphs
    0 references
    sparsity
    0 references

    Identifiers

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