Coloring vertices and edges of a graph by nonempty subsets of a set (Q2430971): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Paul N. Balister / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Ervin Gyoeri / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Richard H. Schelp / rank | |||
Normal rank | |||
Revision as of 18:09, 10 February 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
