On relating edges in graphs without cycles of length 4 (Q2447533)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On relating edges in graphs without cycles of length 4
scientific article

    Statements

    On relating edges in graphs without cycles of length 4 (English)
    0 references
    0 references
    0 references
    28 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    well-covered graph
    0 references
    relating edge
    0 references
    Ford and Fulkerson algorithm
    0 references
    SAT problem
    0 references
    0 references