Results 81 to 90 of about 1,715 (93)
Some of the next articles are maybe not open access.
Neighbor sum distinguishing total colorings via the Combinatorial Nullstellensatz
Science China Mathematics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ding, Laihao +2 more
openaire +4 more sources
An application of the combinatorial Nullstellensatz to a graph labelling problem
Journal of Graph Theory, 2010AbstractAn antimagic labelling of a graph G with m edges and n vertices is a bijection from the set of edges of G to the set of integers {1,…,m}, such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it admits an antimagic labelling.
Hefetz, Dan +2 more
openaire +4 more sources
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ding, Laihao +3 more
openaire +4 more sources
Neighbor Distinguishing Edge Colorings via the Combinatorial Nullstellensatz
SIAM Journal on Discrete Mathematics, 2013Consider a simple graph $G=(V,E)$ and its proper edge coloring $c$ with the elements of the set $\{1,2,\ldots,k\}$ (or any other $k$-element set of real numbers). We say that $c$ is neighbor sum distinguishing if $\sum_{w\in N_G(v)}c(wv)\neq \sum_{w\in N_G(u)}c(wu)$ for every edge $uv\in E$.
Jakub Przybyło
openaire +3 more sources
Neighbor distinguishing total choice number of sparse graphs via the Combinatorial Nullstellensatz
Acta Mathematicae Applicatae Sinica, English Series, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qu, Cun-quan +3 more
openaire +4 more sources
Circular choosability via combinatorial Nullstellensatz
Journal of Graph Theory, 2008AbstractA p‐list assignment L of a graph G assigns to each vertex v of G a set ${{L}}({{v}})\subseteq \{{{0}}{{,}} {{1}}{{,}}\ldots{{,}}\, {{p}}-{{1}}\}$ of permissible colors. We say G is L‐(P, q)‐colorable if G has a (P, q)‐coloring h such that h(v) ϵ L(v) for each vertex v.
Norine, Serguei +2 more
openaire +2 more sources
Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited
Journal of Graph Theory, 2014AbstractConsider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v.
Przybyło, Jakub, Wong, Tsai-Lien
openaire +2 more sources
Tropical Combinatorial Nullstellensatz and Fewnomials Testing
2017Tropical algebra emerges in many fields of mathematics such as algebraic geometry, mathematical physics and combinatorial optimization. In part, its importance is related to the fact that it makes various parameters of mathematical objects computationally accessible.
Dima Grigoriev, Vladimir V. Podolskii
openaire +1 more source
Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
Acta Mathematicae Applicatae Sinica, English Series, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Xiao-wei +2 more
openaire +2 more sources