Results 11 to 20 of about 2,185 (126)

Concise proofs for adjacent vertex-distinguishing total colorings

Discrete Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Adjacent vertex distinguishing total coloring of graphs with maximum degree 4

Discrete Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lu, You, Li, Jiaao, Luo, Rong, Miao, Zhengke   +3 more
openaire   +3 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, Miao Lian-Ying, Duan Yuan-Yuan   +2 more
doaj   +1 more source

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, Parreau, Aline, Pinlou, Alexandre   +2 more
core   +7 more sources

Cartesian积与邻点可区别着色之间的关系(Relation between Cartesian product and adjacent vertex distinguishing coloring)

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

2-Restricted optimal pebbling number [PDF]

Mathematics and Computational Sciences
Let 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, Saeid Alikhani, Ali Delavar Khalafi, Fatemeh Aghaei   +3 more
doaj   +1 more source

Adjacent vertex distinguishing total colorings of 2-degenerate graphs

Discrete Mathematics, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhengke Miao, Rui Shi, Xiaolan Hu, Rong Luo   +3 more
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

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