Group sum chromatic number of graphs

DOI10.1016/J.EJC.2016.02.002MaRDI QIDQ268265zbMATH OpenOpenAlexFDO

Authors Marcin Anholcer, Sylwia Cichacz

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)

Abstract: We investigate the extit{group sum chromatic number} ($gchi(G)$) of graphs, i.e. the smallest value $s$ such that taking any Abelian group $gr$ of order $s$, there exists a function $f:E(G)ightarrowgr$ such that the sums of edge labels properly colour the vertices. It is known that $gchi(G)inchi(G),chi(G)+1$ for any graph $G$ with no component of order less than $3$ and we characterize the graphs for which $gchi(G)=chi(G)$.

Recommendations

• scientific article; zbMATH DE number 2188403
• On group chromatic number of graphs
• Comparison of sum choice number with chromatic sum
• Group twin coloring of graphs
• Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs

Cites work

• scientific article; zbMATH DE number 2104734 (Why is no real title available?)
• A-cordial graphs
• Degree constrained subgraphs
• Edge weights and vertex colours
• Edge-magic group labellings of countable graphs
• Group distance magic labeling of Cartesian product of cycles
• Harmonious groups
• Harmonious order of graphs
• Linear homogeneous Diophantine equations and magic labelings of graphs
• On Additive Bases and Harmonious Graphs
• On vertex-coloring 13-edge-weighting
• On zero-sum partitions and anti-magic trees
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Vertex-colouring edge-weightings

Cited in

(10)

• Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
• On group chromatic number of graphs
• Group irregularity strength of connected graphs
• An inequality for the group chromatic number of a graph
• On the edge-difference and edge-sum chromatic sum of the simple graphs
• Group chromatic number of planar graphs of girth at least 4
• scientific article; zbMATH DE number 4173004 (Why is no real title available?)
• Complexity of the improper twin edge coloring of graphs
• scientific article; zbMATH DE number 2188403 (Why is no real title available?)
• On zero sum-partition of abelian groups into three sets and group distance magic labeling

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

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