On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs

DOI10.1016/j.entcs.2019.08.063OpenAlexW2977961370WikidataQ113317366 ScholiaQ113317366MaRDI QIDQ2132413

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

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.063

zbMATH Keywords

graph labellingsproper labellingsgap-labellings

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

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
• Graceful, Harmonious and Magic Type Labelings
• The multiset chromatic number of a graph
• Color-Induced Graph Colorings

This page was built for publication: On the complexity of gap-\([2]\)-vertex-labellings of subcubic bipartite graphs