Labeling graphs with two distance constraints (Q998444): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2007.10.036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023125314 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On \(L(d,1)\)-labelings of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The $L(2,1)$-Labeling Problem on Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3838194 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relating path coverings to vertex labellings with a condition at distance two / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank | |||
Normal rank | |||
Latest revision as of 01:08, 29 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Labeling graphs with two distance constraints |
scientific article |
Statements
Labeling graphs with two distance constraints (English)
0 references
28 January 2009
0 references
\(L(2, 1)\)-labeling
0 references
\(L(d_{1}, d_{2},p, q)\)-labeling
0 references
tree
0 references
path
0 references
power
0 references
Cartesian product
0 references
