The number of shortest cycles and the chromatic uniqueness of a graph (Q3990870)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The number of shortest cycles and the chromatic uniqueness of a graph
scientific article

    Statements

    The number of shortest cycles and the chromatic uniqueness of a graph (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    shortest cycles
    0 references
    chromatic uniquenes
    0 references
    upper bound
    0 references
    2-connected graph
    0 references
    extremal graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references