Results 11 to 20 of about 2,201 (118)
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 colorings of 2-degenerate graphs
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhengke Miao +3 more
openaire +3 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 +3 more
openaire +3 more sources
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