On the total versions of 1-2-3-conjecture for graphs and hypergraphs
From MaRDI portal
Publication:6103468
DOI10.1016/j.dam.2023.03.021zbMath1518.05060arXiv2204.13936OpenAlexW4362472559WikidataQ123352196 ScholiaQ123352196MaRDI QIDQ6103468
Publication date: 5 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.13936
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex-coloring 2-edge-weighting of graphs
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- Edge weights and vertex colours
- The 1-2-3 conjecture almost holds for regular graphs
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
- The 1-2-3-Conjecture for Hypergraphs
- On the 1-2-3-conjecture