The graceful chromatic number for some particular classes of graphs

Radu Mincu, Camelia Obreja, Alexandru Popa

Research output: Contribution to conferencePaperpeer-review

Abstract

Graph colorings are a major area of study in graph theory involving the constrained assignment of labels(colors) to vertices or edges. There are many types of colorings defined. The most common type of coloring is the proper vertex k-coloring which is defined as a vertex coloring from a set of k colors such that no two adjacent vertices share a common color. Our central focus in this paper is a variant of the proper vertex k-coloring problem, termed graceful coloring introduced by Gary Chartrand in 2015 and defined as follows. A graceful kcoloring of a nonempty graph G is a proper vertex coloring c : V (G) [k], where k-2, that induces a proper edge coloring c0 : E(G) [k-1] defined by c0(uv) = |c(u)-c(v)|. In this work we find the graceful chromatic number for some well-known classes of graphs such as Friendship graph, Petersen graph, Cactus graph and others.

Original languageEnglish
Pages99-102
Number of pages4
Publication statusPublished - Jan 1 2019
Event17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019 - Enschede, Netherlands
Duration: Jul 1 2019Jul 3 2019

Conference

Conference17th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2019
CountryNetherlands
CityEnschede
Period7/1/197/3/19

ASJC Scopus subject areas

  • Control and Optimization
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'The graceful chromatic number for some particular classes of graphs'. Together they form a unique fingerprint.

Cite this