Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (Q2636822)

From MaRDI portal
Revision as of 09:19, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
scientific article

    Statements

    Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank (English)
    0 references
    0 references
    0 references
    18 February 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    rank of graphs
    0 references
    matching number
    0 references
    chromatic index
    0 references
    independence number
    0 references
    0 references