Anti-\(k\)-labeling of graphs (Q2286097): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127456928, #quickstatements; #temporary_batch_1722610195449
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1810.06984 / rank
 
Normal rank
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
Property / Wikidata QID
 
Property / Wikidata QID: Q127456928 / rank
 
Normal rank

Latest revision as of 16:50, 2 August 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
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2020
    0 references
    channel assignment problem
    0 references

    Identifiers