Results 21 to 30 of about 2,983 (119)
Locally identifying coloring in bounded expansion classes of graphs [PDF]
, 2012 A proper vertex coloring of a graph is said to be locally identifying if the sets of colors in the closed neighborhood of any two adjacent non-twin vertices are distinct.
Gonçalves, Daniel +2 more
core +7 more sources
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
Sequence variations of the 1-2-3 Conjecture and irregularity strength [PDF]
, 2012 Karonski, Luczak, and Thomason (2004) conjectured that, for any connected graph G on at least three vertices, there exists an edge weighting from {1,2,3} such that adjacent vertices receive different sums of incident edge weights.
Seamone, Ben, Stevens, Brett
core +3 more sources
Zhejiang Daxue xuebao. Lixue ban, 2017 A proper k-edge coloring of a graph G is an assignment of k colors 1, 2, …, k to edges of G such that any two adjacent edges receive the different colors.
WANGGuoxing(王国兴)
doaj +1 more source
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 2014 In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs.
Schweitzer, Pascal
core +3 more sources
Progress on the adjacent vertex distinguishing edge colouring conjecture
, 2020 A proper edge colouring of a graph is adjacent vertex distinguishing if no two adjacent vertices see the same set of colours. Using a clever application of the Local Lemma, Hatami (2005) proved that every graph with maximum degree $\Delta$ and no ...
Joret, Gwenaël, Lochet, William
core +1 more source
2-Restricted optimal pebbling number [PDF]
Mathematics and Computational SciencesLet G=(V,E) be a simple graph. A pebbling configuration on G is a function f:V→Ν ∪{0} that assigns a non-negative integer number of pebbles to each vertex.
Juma Gul Dehqan +3 more
doaj +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
On Computing Centroids According to the p-Norms of Hamming Distance Vectors [PDF]
, 2019 In this paper we consider the p-Norm Hamming Centroid problem which asks to determine whether some given strings have a centroid with a bound on the p-norm of its Hamming distances to the strings.
Chen, Jiehua +2 more
core +2 more sources
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