Graphs without gap-vertex-labellings: families and bounds

DOI10.1016/j.dam.2023.06.036arXiv2007.01431OpenAlexW3039214111MaRDI QIDQ6064864

C. A. Weffort-Santos, Rafael C. S. Schouery

Publication date: 11 December 2023

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

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

zbMATH Keywords

gap-labellingsgap-strengthproper-labellings

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• On strongly planar not-all-equal 3SAT
• Algorithmic complexity of proper labeling problems
• Gap vertex-distinguishing edge colorings of graphs
• Solving a linear equation in a set of integers I

This page was built for publication: Graphs without gap-vertex-labellings: families and bounds