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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:59, 30 January 2024

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