Sigma coloring on powers of paths and some families of snarks

DOI10.1016/J.ENTCS.2019.08.043OpenAlexW2979290407WikidataQ113317388 ScholiaQ113317388MaRDI QIDQ2132385FDOQ2132385

Authors: Luis Gustavo da Soledade Gonzaga, Sheila M. de Almeida 

Publication date: 27 April 2022

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

Recommendations

• The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$
• On the sigma chromatic number of the join of a finite number of paths and cycles
• The sigma chromatic number of a graph
• Sum-defined colorings in graphs
• On the neighbor sum-distinguishing vertex coloring of a graph

zbMATH Keywords

vertex coloringsnarksigma coloringpower of path

Mathematics Subject Classification ID

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

Cites Work

• The circular chromatic index of Goldberg snarks
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Construction of class two graphs with maximum vertex degree three
• Title not available (Why is that?)
• The sigma chromatic number of a graph
• The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$
• Sigma partitioning: complexity and random graphs

Cited In (5)

• Title not available (Why is that?)
• Magic sigma coloring of a graph
• Petersen-colorings and some families of snarks
• Sigma chromatic number of the middle graph of some general families of trees of height 2
• Joins of paths and cycles of equal order with sigma chromatic number 2

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

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