(d,1)-total labeling of graphs with a given maximum average degree (Q3376692): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
| Property / author | |||
| Property / author: Andre Raspaud / rank | |||
Normal rank | |||
| 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.1002/jgt.20124 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4235429310 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum partition of a matroid into independent subsets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4535043 / rank | |||
Normal rank | |||
Latest revision as of 11:26, 24 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | (d,1)-total labeling of graphs with a given maximum average degree |
scientific article |
Statements
(d,1)-total labeling of graphs with a given maximum average degree (English)
0 references
24 March 2006
0 references
total coloring
0 references
