Results 11 to 20 of about 1,707 (110)
Weak sequenceability in cyclic groups
Journal of Combinatorial Designs, Volume 30, Issue 12, Page 735-751, December 2022., 2022 Abstract A subset A $A$ of an abelian group G $G$ is sequenceable if there is an ordering ( a 1 , … , a k ) $({a}_{1},\ldots ,{a}_{k})$ of its elements such that the partial sums ( s 0 , s 1 , … , s k ) $({s}_{0},{s}_{1},\ldots ,{s}_{k})$, given by s 0 = 0 ${s}_{0}=0$ and s i = ∑ j = 1 i a j ${s}_{i}={\sum }_{j=1}^{i}{a}_{j}$ for 1 ≤ i ≤ k $1\le i\le k$
Simone Costa, Stefano Della Fiore
wiley +1 more source
Between proper and strong edge‐colorings of subcubic graphs
Journal of Graph Theory, Volume 101, Issue 4, Page 686-716, December 2022., 2022 Abstract In a proper edge‐coloring the edges of every color form a matching. A matching is induced if the end‐vertices of its edges induce a matching. A strong edge‐coloring is an edge‐coloring in which the edges of every color form an induced matching.
Herve Hocquard +2 more
wiley +1 more source
Abstract and Applied Analysis, Volume 2022, Issue 1, 2022., 2022 In this article, we study and investigate the analytical solutions of the space‐time nonlinear fractional modified KDV‐Zakharov‐Kuznetsov (mKDV‐ZK) equation. We have got new exact solutions of the fractional mKDV‐ZK equation by using first integral method; we found new types of hyperbolic solutions and trigonometric solutions by symbolic computation.
Mohamed A. Abdoon +3 more
wiley +1 more source
A Short Proof of Combinatorial Nullstellensatz [PDF]
The American Mathematical Monthly, 2010 In this note we give a short, direct proof of the well known Combinatorial Nullstellensatz.
openaire +3 more sources
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
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
Combinatorial Nullstellensatz [PDF]
Combinatorics, Probability and Computing, 1999 We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems.
openaire +1 more source
Some extensions of Alon's Nullstellensatz [PDF]
, 2011 Alon's combinatorial Nullstellensatz, and in particular the resulting nonvanishing criterion is one of the most powerful algebraic tools in combinatorics, with many important applications.
Kós, Géza +2 more
core +1 more source
A Generalization of Combinatorial Nullstellensatz [PDF]
The Electronic Journal of Combinatorics, 2010 In this note we give an extended version of Combinatorial Nullstellensatz, with weaker assumption on nonvanishing monomial. We also present an application of our result in a situation where the original theorem does not seem to work.
openaire +3 more sources
Constructing integer-magic graphs via the Combinatorial Nullstellensatz
The Art of Discrete and Applied Mathematics, 2022 Summary: Let Abe a nontrivial abelian group and \(A^\ast = A \backslash \{0\}\). A graph is \(A\)-magic if there exists an edge labeling fusing elements of \(A^\ast\) which induces a constant vertex labeling of the graph. Such a labeling \(f\) is called an \(A\)-magic labeling and the constant value of the induced vertex labeling is called an \(A ...
Low, Richard M., Roberts, Dan
openaire +3 more sources