Graphs whose acyclic graphoidal covering number is one less than its maximum degree (Q5948980)

From MaRDI portal
Revision as of 01:37, 22 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1672505
Language Label Description Also known as
English
Graphs whose acyclic graphoidal covering number is one less than its maximum degree
scientific article; zbMATH DE number 1672505

    Statements

    Graphs whose acyclic graphoidal covering number is one less than its maximum degree (English)
    0 references
    0 references
    0 references
    22 July 2002
    0 references
    0 references
    acyclic graphoidal cover
    0 references
    covering number
    0 references