The 3‐connected graphs with a maximum matching containing precisely one contractible edge (Q4277986)

From MaRDI portal
scientific article; zbMATH DE number 490725
Language Label Description Also known as
English
The 3‐connected graphs with a maximum matching containing precisely one contractible edge
scientific article; zbMATH DE number 490725

    Statements

    The 3‐connected graphs with a maximum matching containing precisely one contractible edge (English)
    0 references
    0 references
    0 references
    0 references
    29 August 1994
    0 references
    3-connected graph
    0 references
    maximum matching
    0 references
    contractible edge
    0 references
    characterization
    0 references

    Identifiers