Coloring vertices and edges of a graph by nonempty subsets of a set (Q2430971): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Set colorings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on ternary sequences of strings of 0 and 1 / rank | |||
Normal rank | |||
Latest revision as of 22:43, 3 July 2024
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
