Neighbour-distinguishing labellings of families of graphs
From MaRDI portal
Publication:2141099
DOI10.1007/s00373-022-02492-0zbMath1493.05266OpenAlexW4280570552MaRDI QIDQ2141099
Publication date: 23 May 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02492-0
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Graphs with vertex-coloring and detectable 2-edge-weighting
- Vertex coloring of graphs by total 2-weightings
- Vertex-coloring 2-edge-weighting of graphs
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Multi-set neighbor distinguishing 3-edge coloring
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Vertex colouring edge partitions
- A relaxed case on 1-2-3 conjecture
- On the 1-2-3-conjecture