Neighbour-distinguishing labellings of powers of paths and powers of cycles

DOI10.1007/s10878-020-00540-0zbMath1439.05199OpenAlexW3007829812MaRDI QIDQ2175048

C. N. Campos, Simone Dantas, Diana Sasaki, Atílio G. Luiz

Publication date: 27 April 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00540-0

zbMATH Keywords

powers of cyclespowers of paths1, 2 conjecture

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)

Cites Work

• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• An improved upper bound on edge weight choosability of graphs
• Vertex coloring of graphs by total 2-weightings
• Vertex-coloring 2-edge-weighting of graphs
• Vertex-coloring edge-weightings of graphs
• 1,2 conjecture-the multiplicative version
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• On the total-neighbor-distinguishing index by sums
• Degree constrained subgraphs
• A relaxed case on 1-2-3 conjecture
• On the 1-2-3-conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item