The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures

DOI10.1007/978-3-031-25211-2_16MaRDI QIDQ6132535

Hervé Hocquard, Julien Bensmail, Pierre-Marie Marcille

Publication date: 17 August 2023

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

zbMATH Keywords

1-2-3 conjecturedistinguishing labellingsum distinction

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items

The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures

Cites Work

• Unnamed Item
• Algorithmic complexity of proper labeling problems
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• A dynamic survey of graph labeling
• Multi-set neighbor distinguishing 3-edge coloring
• Edge weights and vertex colours
• On decomposing regular graphs into locally irregular subgraphs
• Vertex colouring edge partitions
• The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures