Anti-\(k\)-labeling of graphs

DOI10.1016/j.amc.2019.06.063zbMath1433.05268arXiv1810.06984OpenAlexW2963916205WikidataQ127456928 ScholiaQ127456928MaRDI QIDQ2286097

Lin Chen, Xiaxia Guan, Weihua Yang, Shurong Zhang, Rong-Hua Li

Publication date: 9 January 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.06984

zbMATH Keywords

channel assignment problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs ⋮ Incidence coloring of mycielskians with fast algorithm

Cites Work

• No-hole \((r+1)\)-distant colorings
• Distance-two labelings of digraphs
• On the \(L(p,1)\)-labelling of graphs
• A survey on labeling graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• Unnamed Item
• Unnamed Item
• Unnamed Item