Anti-\(k\)-labeling of graphs (Q2286097): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Distance-two labelings of digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5466046 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3322121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the \(L(p,1)\)-labelling of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Labelling Graphs with a Condition at Distance 2 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: No-hole \((r+1)\)-distant colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A survey on labeling graphs with a condition at distance two / rank | |||
Normal rank |
Revision as of 09:41, 21 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Anti-\(k\)-labeling of graphs |
scientific article |
Statements
Anti-\(k\)-labeling of graphs (English)
0 references
9 January 2020
0 references
channel assignment problem
0 references