Results 41 to 50 of about 135,434 (260)
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
The harmonious chromatic number of almost all trees [PDF]
, 1995 A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards +4 more
core +3 more sources
Closure under the Majorization Relation and the Distinguishing Chromatic Number of Circulant Graphs
, 2019 This dissertation addresses two distinct problems in graph theory and in each case advances results for invariants of graphs. The first problem investigates the arrangement of the degree sequences of various classes of graphs in the dominance order.
Jean Guillaume
semanticscholar +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
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
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
The adjacent vertex distinguishing total chromatic number
Discrete Mathematics, 2012 A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges receive different colours and every vertex and incident edge receive different colours.
Coker, Tom, Johannson, Karen R
openaire +4 more sources
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