Sigma coloring on powers of paths and some families of snarks

DOI10.1016/j.entcs.2019.08.043OpenAlexW2979290407WikidataQ113317388 ScholiaQ113317388MaRDI QIDQ2132385

Sheila Morais de Almeida, Luis Gustavo da Soledade Gonzaga

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.043

zbMATH Keywords

snarkvertex coloringsigma coloringpower of path

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (3)

Joins of paths and cycles of equal order with sigma chromatic number 2 ⋮ Magic sigma coloring of a graph ⋮ Unnamed Item

Cites Work

• Unnamed Item
• The sigma chromatic number of a graph
• Construction of class two graphs with maximum vertex degree three
• The circular chromatic index of Goldberg snarks
• The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Sigma Partitioning: Complexity and Random Graphs

This page was built for publication: Sigma coloring on powers of paths and some families of snarks