Coloring vertices and edges of a graph by nonempty subsets of a set (Q2430971)

From MaRDI portal
Revision as of 22:43, 3 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
Coloring vertices and edges of a graph by nonempty subsets of a set
scientific article

    Statements

    Coloring vertices and edges of a graph by nonempty subsets of a set (English)
    0 references
    8 April 2011
    0 references
    strongly set colorable graph
    0 references
    0 references
    0 references
    0 references

    Identifiers