Results 1 to 10 of about 57 (57)
Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings
Theory and Applications of Graphs, 2022 Let $A$ be a nontrivial abelian group and $A^* = A \setminus \{0\}$. A graph is $A$-magic if there exists an edge labeling $f$ using elements of $A^*$ which induces a constant vertex labeling of the graph.
Richard Low, Dan Roberts
doaj +1 more source
Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs without Theta Graphs Θ2,1,2
Mathematics, 2021 A theta graph Θ2,1,2 is a graph obtained by joining two vertices by three internally disjoint paths of lengths 2, 1, and 2. A neighbor sum distinguishing (NSD) total coloring ϕ of G is a proper total coloring of G such that ∑z∈EG(u)∪{u}ϕ(z)≠∑z∈EG(v)∪{v}ϕ(
Donghan Zhang
doaj +1 more source
Graph choosability and double list colorability [PDF]
Opuscula Mathematica, 2010 In this paper, we give a sufficient condition for graph choosability, based on Combinatorial Nullstellensatz and a specific property, called "double list colorability", which means that there is a list assignment for which there are exactly two ...
Hamid-Reza Fanaï
doaj +1 more source
List circular backbone colouring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 A natural generalization of graph colouring involves taking colours from a metric space and insisting that the endpoints of an edge receive colours separated by a minimum distance dictated by properties of the edge.
Frederic Havet, Andrew D. King
doaj +1 more source
Neighbor Product Distinguishing Total Colorings of Planar Graphs with Maximum Degree at least Ten
Discussiones Mathematicae Graph Theory, 2021 A proper [k]-total coloring c of a graph G is a proper total coloring c of G using colors of the set [k] = {1, 2, . . . , k}. Let p(u) denote the product of the color on a vertex u and colors on all the edges incident with u.
Dong Aijun, Li Tong
doaj +1 more source
The Alon-Tarsi number of two kinds of planar graphs
Electronic Journal of Graph Theory and Applications, 2023 The Alon-Tarsi number AT(G) of a graph G is the least k for which there is an orientation D of G with max outdegree k − 1 such that the number of spanning Eulerian subgraphs of G with an even number of edges differs from the number of spanning Eulerian ...
Zhiguo Li, Qing Ye, Zeling Shao
doaj +1 more source
Bounding the monomial index and (1,l)-weight choosability of a graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Ben Seamone
doaj +1 more source
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