Results 31 to 40 of about 16,459 (227)
A Tight Bound on the Set Chromatic Number
Discussiones Mathematicae Graph Theory, 2013 We provide a tight bound on the set chromatic number of a graph in terms of its chromatic number. Namely, for all graphs G, we show that χs(G) > ⌈log2 χ(G)⌉ + 1, where χs(G) and χ(G) are the set chromatic number and the chromatic number of G ...
Sereni Jean-Sébastien +1 more
doaj +1 more source
A New Game Invariant of Graphs: the Game Distinguishing Number [PDF]
, 2017 The distinguishing number of a graph $G$ is a symmetry related graph invariant whose study started two decades ago. The distinguishing number $D(G)$ is the least integer $d$ such that $G$ has a $d$-distinguishing coloring.
Gravier, Sylvain +3 more
core +2 more sources
On the total and AVD-total coloring of graphs
AKCE International Journal of Graphs and Combinatorics, 2020 A total coloring of a graph G is an assignment of colors to the vertices and the edges such that (i) no two adjacent vertices receive same color, (ii) no two adjacent edges receive same color, and (iii) if an edge e is incident on a vertex v, then v and ...
B. S. Panda, Shaily Verma, Yash Keerti
doaj +1 more source
General Vertex-Distinguishing Total Coloring of Graphs
Journal of Applied Mathematics, 2014 The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for which the vertices and edges of G are colored using k colors such that any two vertices have distinct sets of colors of them and their incident edges.
Chanjuan Liu, Enqiang Zhu
doaj +1 more source
Sex-related differences in chromatic sensitivity [PDF]
, 2008 Generally women are believed to be more discriminating than men in the use of colour names and this is often taken to imply superior colour vision. However, if both X-chromosome linked colour deficient males (~8%) and females (
J.A. HARLOW +7 more
core +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Discussiones Mathematicae Graph Theory, 2020 Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings
Song Wen-Yao +2 more
doaj +1 more source
Some Equal Degree Graph Edge Chromatic Number
MATEC Web of Conferences, 2016 Let G(V, E) be a simple graph and k is a positive integer, if it exists a mapping of f, and satisfied with f(e1)≠6 = f(e2) for two incident edges e1,e2∉E(G), f(e1)≠6=f(e2), then f is called the k-proper-edge coloring of G(k-PEC for short).
Liu Jun +4 more
doaj +1 more source
Additive List Coloring of Planar Graphs with Given Girth
Discussiones Mathematicae Graph Theory, 2020 An additive coloring of a graph G is a labeling of the vertices of G from {1, 2, . . . , k} such that two adjacent vertices have distinct sums of labels on their neighbors.
Brandt Axel +2 more
doaj +1 more source
General neighbour-distinguishing index via chromatic number
Discrete Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Horňák, Mirko, Soták, Roman
openaire +1 more source
Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km,N(m < n)
Discussiones Mathematicae Graph Theory, 2013 Let G be a simple graph. An IE-total coloring f of G is a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color. Let C(u) be the set of colors of vertex u and edges incident to u under f. For an IE-total coloring
Chen Xiang’en, Gao Yuping, Yao Bing
doaj +1 more source