Group sum chromatic number of graphs

DOI10.1016/j.ejc.2016.02.002zbMath1333.05100arXiv1205.2572OpenAlexW1955788845MaRDI QIDQ268265

Sylwia Cichacz, Marcin Anholcer

Publication date: 14 April 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.2572

zbMATH Keywords

harmonious order of graphsvertex colouring \(k\)-edge-labelling

Mathematics Subject Classification ID

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

Related Items (4)

Complexity of the improper twin edge coloring of graphs ⋮ On zero sum-partition of Abelian groups into three sets and group distance magic labeling ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs ⋮ Group irregularity strength of connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex-coloring 2-edge-weighting of graphs
• Edge-magic group labellings of countable graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On vertex-coloring 13-edge-weighting
• On zero-sum partitions and anti-magic trees
• Harmonious order of graphs
• A-cordial graphs
• Edge weights and vertex colours
• Vertex-colouring edge-weightings
• Degree constrained subgraphs
• Linear homogeneous Diophantine equations and magic labelings of graphs
• Harmonious groups
• On Additive Bases and Harmonious Graphs

This page was built for publication: Group sum chromatic number of graphs