On inducing degenerate sums through 2-labellings

DOI10.1007/s00373-024-02758-9WikidataQ128179723 ScholiaQ128179723MaRDI QIDQ6154381

Hervé Hocquard, Pierre-Marie Marcille, Julien Bensmail

Publication date: 15 February 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

vertex-arboricity1-2-3 conjecture2-labellingdegenerate sum

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Algorithmic complexity of proper labeling problems
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On the maximum average degree and the oriented chromatic number of a graph
• Edge weights and vertex colours
• The dichromatic number of a digraph
• On proper labellings of graphs with minimum label sum
• Going wide with the 1-2-3 conjecture
• On the role of 3s for the 1--2--3 conjecture
• On the vertex-arboricity of planar graphs
• The point-arboricity of a graph
• A relaxed case on 1-2-3 conjecture
• An injective version of the 1-2-3 conjecture
• Critical Point-Arboritic Graphs
• A Note on the Vertex Arboricity of a Graph

This page was built for publication: On inducing degenerate sums through 2-labellings