An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (Q828980)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph
scientific article

    Statements

    An upper bound on the diameter of a 3-edge-connected \(C_4\)-free graph (English)
    0 references
    0 references
    0 references
    5 May 2021
    0 references
    diameter
    0 references
    edge-connectivity
    0 references

    Identifiers