Sigma Partitioning: Complexity and Random Graphs

zbMath1403.05118arXiv1403.6288MaRDI QIDQ4611774

Arash Ahadi, Mohammad-Reza Sadeghi, Ali Dehghan

Publication date: 21 January 2019

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

zbMATH Keywords

computational complexitylucky labelingadditive coloringplanar not-all-equal 3-SATplanar not-all-equal 3-SAT type 2sigma chromatic numbersigma partitioning

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Sigma coloring on powers of paths and some families of snarks ⋮ Magic sigma coloring of a graph

This page was built for publication: Sigma Partitioning: Complexity and Random Graphs