Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2017.05.037 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2625701133 / rank | |||
Normal rank | |||
Revision as of 21:21, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Neighbor sum distinguishing total coloring of planar graphs without 5-cycles |
scientific article |
Statements
Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (English)
0 references
7 September 2017
0 references
neighbor sum distinguishing total coloring
0 references
combinatorial Nullstellensatz
0 references
planar graph
0 references
