Uniquely pressable graphs: characterization, enumeration, and recognition (Q1755655)

From MaRDI portal
Revision as of 02:43, 18 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129030674, #quickstatements; #temporary_batch_1723945101418)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Uniquely pressable graphs: characterization, enumeration, and recognition
scientific article

    Statements

    Uniquely pressable graphs: characterization, enumeration, and recognition (English)
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    pressing sequence
    0 references
    adjacency matrix
    0 references
    Cholesky factorization
    0 references
    binary matrix
    0 references
    phylogenetics
    0 references
    genome reversals
    0 references
    graph theory
    0 references
    computational complexity
    0 references

    Identifiers

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