The sigma chromatic number of the circulant graphs Cn (1, 2), Cn (1, 3), and C2n (1, n)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Original languageEnglish
Title of host publicationDiscrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Revised Selected Papers
EditorsToshinori Sakai, Hiro Ito, Jin Akiyama
PublisherSpringer Verlag
Pages216-227
Number of pages12
ISBN (Print)9783319485317
DOIs
StatePublished - 2016
Event18th Japan Conference on Discrete and Computational Geometry and Graphs, JCDCGG 2015 - Kyoto, Japan
Duration: Sep 14 2015Sep 16 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9943 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th Japan Conference on Discrete and Computational Geometry and Graphs, JCDCGG 2015
Country/TerritoryJapan
CityKyoto
Period9/14/159/16/15

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • General Computer Science

Keywords

  • Circulant graph
  • Neighbor-distinguishing coloring
  • Sigma coloring

Fingerprint

Dive into the research topics of 'The sigma chromatic number of the circulant graphs Cn (1, 2), Cn (1, 3), and C2n (1, n)'. Together they form a unique fingerprint.

Cite this