Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs

DOI10.1016/j.dam.2021.05.010zbMath1468.05274OpenAlexW3164462832WikidataQ123308787 ScholiaQ123308787MaRDI QIDQ2030247

Baoyindureng Wu, Fangxia Wang

Publication date: 7 June 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.05.010

zbMATH Keywords

trees2-dimensional gridsanti-\(k\)-labeling problemno-hole anti-\(k\)-labeling number

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• No-hole \((r+1)\)-distant colorings
• Matching theory
• No-hole 2-distant colorings
• Anti-\(k\)-labeling of graphs
• \(L(p,q)\) labeling of \(d\)-dimensional grids
• Embedding Arbitrary Graphs of Maximum Degree Two
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs