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

DOI10.1007/978-3-031-25211-2_16MaRDI QIDQ6132535zbMATH OpenFDO

Authors Julien Bensmail, Hervé Hocquard, 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)

Recommendations

• The $L(2,1)$-Labeling Problem on Graphs
• scientific article; zbMATH DE number 2091962
• The \(L(2,1)\)-\({\mathcal F}\)-labeling problem of graphs
• \(L(2,1)\)-labeling of graphs: known results and open problems
• scientific article; zbMATH DE number 2073985
• The \(L(3,2,1)\)-labeling problem on graphs
• The \(L (3, 2, 1)\)-labeling problem on graphs
• The \(L(d_1,d_2)\)-labeling problem on graphs
• scientific article; zbMATH DE number 5583498
• scientific article; zbMATH DE number 2058030

Cites work

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

Cited in

(1)

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

This page was built for publication: The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132535)