Results 31 to 40 of about 57,891 (276)
Twin edge colorings of certain square graphs and product graphs
Electronic Journal of Graph Theory and Applications, 2016 A twin edge $k\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is the sum in $\mathbb{Z}_k$ of the colors of the edges ...
R Rajarajachozhan, R. Sampathkumar
doaj +1 more source
A New Proof for a Result on the Inclusion Chromatic Index of Subcubic Graphs
Axioms, 2022 Let G be a graph with a minimum degree δ of at least two. The inclusion chromatic index of G, denoted by χ⊂′(G), is the minimum number of colors needed to properly color the edges of G so that the set of colors incident with any vertex is not contained ...
Lily Chen, Yanyi Li
doaj +1 more source
Color diversity index : the effect of chromatic adaptation [PDF]
, 2011 Common descriptors of light quality fail to predict the chromatic diversity produced by the same illuminant in different contexts. The aim of this paper was to study the influence of the chromatic adaptation in the context of the development of the ...
Linhares, João M. M. +1 more
core +1 more source
The b-chromatic index of graphs
Discrete Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Campos +10 more
openaire +2 more sources
On the Star Chromatic Index of Generalized Petersen Graphs
Discussiones Mathematicae Graph Theory, 2021 The star k-edge-coloring of graph G is a proper edge coloring using k colors such that no path or cycle of length four is bichromatic. The minimum number k for which G admits a star k-edge-coloring is called the star chromatic index of G, denoted by χ′s (
Zhu Enqiang, Shao Zehui
doaj +1 more source
Structural Properties of Index Coding Capacity Using Fractional Graph Theory [PDF]
, 2015 The capacity region of the index coding problem is characterized through the notion of confusion graph and its fractional chromatic number. Based on this multiletter characterization, several structural properties of the capacity region are established ...
Arbabjolfaei, Fatemeh, Kim, Young-Han
core +1 more source
Conflict-free chromatic number vs conflict-free chromatic index
, 2020 A vertex coloring of a given graph $G$ is conflict-free if the closed neighborhood of every vertex contains a unique color (i.e. a color appearing only once in the neighborhood). The minimum number of colors in such a coloring is the conflict-free chromatic number of $G$, denoted $ _{CF}(G)$. What is the maximum possible conflict-free chromatic number
Dębski, Michał, Przybyło, Jakub
openaire +2 more sources
Electronic Notes in Discrete Mathematics, 2013 Abstract A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to a vertex in each other color class. The b-chromatic number of G is the maximum integer χ b ( G ) for which G has a b-coloring with χ b ( G ) colors.
Carlos Vinícius G.C.Lima +4 more
openaire +2 more sources
Graph Theory versus Minimum Rank for Index Coding
, 2014 We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negative result: all known graph theoretic bounds are within a logarithmic ...
Dimakis, Alexandros G. +2 more
core +1 more source
Restrained star edge coloring of graphs and its application in optimal & safe storage practices
Ratio Mathematica, 2023 In this paper we introduce the concept of restrained star edge coloring of graphs by restraining the conditions of the star coloring of graphs. The restrained star edge coloring of graphs is a path based graph coloring which is said to be proper if all ...
W. Evangeline Lydia +1 more
doaj +1 more source