An injective version of the 1-2-3 conjecture

DOI10.1007/S00373-020-02252-YMaRDI QIDQ2657086zbMATH OpenOpenAlexWikidataFDO

Authors Julien Bensmail, Bi Li, Binlong Li

Publication date 17 March 2021

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

Full work available at URL https://doi.org/10.1007/s00373-020-02252-y

zbMATH Keywords

1-2-3 conjectureinjective vertex-colouringproper labelling

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Going wide with the 1-2-3 conjecture
• The 1,2,3-conjecture and 1,2-conjecture for sparse graphs
• On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture
• Edge-injective and edge-surjective vertex labellings
• On the role of 3s for the 1-2-3 conjecture

Cites work

• Counterexamples to a conjecture on injective colorings
• Edge weights and vertex colours
• Edge weights and vertex colours: minimizing sum count
• Hard tiling problems with simple tiles
• Highly irregular graphs
• On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
• On decomposing regular graphs into locally irregular subgraphs
• On neighbour sum-distinguishing \(\{0,1\}\)-edge-weightings of bipartite graphs
• On the complexity of vertex-coloring edge-weightings
• On the injective chromatic number of graphs
• The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture

Cited in

(15)

• Is there any polynomial upper bound for the universal labeling of graphs?
• Further evidence towards the multiplicative 1-2-3 conjecture
• On proper labellings of graphs with minimum label sum
• On a list variant of the multiplicative 1-2-3 conjecture
• Going wide with the 1-2-3 conjecture
• On minimizing the maximum color for the 1-2-3 conjecture
• On the role of 3s for the 1-2-3 conjecture
• On a combination of the 1-2-3 conjecture and the antimagic labelling conjecture
• On Proper Labellings of Graphs with Minimum Label Sum
• Edge-injective and edge-surjective vertex labellings
• A notion of vertex equitability for proper labellings
• On inducing degenerate sums through 2-labellings
• Adding direction constraints to the 1-2-3 conjecture
• Highly irregular graph decompositions
• Some remarks and results on the standard (2,2)-conjecture

This page was built for publication: An injective version of the 1-2-3 conjecture

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