The sigma chromatic number of a graph (Q607685): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00373-010-0952-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2101062861 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex colouring edge partitions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3824455 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge weights and vertex colours / rank | |||
Normal rank | |||
Latest revision as of 13:42, 3 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The sigma chromatic number of a graph |
scientific article |
Statements
The sigma chromatic number of a graph (English)
0 references
3 December 2010
0 references
neighbor-distinguishing coloring
0 references
sigma coloring
0 references
