Results 21 to 30 of about 1,773 (109)
Coloring of the d th Power of the Face-Centered Cubic Grid
Discussiones Mathematicae Graph Theory, 2021 The face-centered cubic grid is a three dimensional 12-regular infinite grid. This graph represents an optimal way to pack spheres in the three-dimensional space.
Gastineau Nicolas, Togni Olivier
doaj +1 more source
2-Distance Colorings of Integer Distance Graphs
Discussiones Mathematicae Graph Theory, 2019 A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. . ., k} such that every two vertices at distance at most 2 receive distinct colors.
Benmedjdoub Brahim +2 more
doaj +1 more source
List Edge Coloring of Planar Graphs without 6-Cycles with Two Chords
Discussiones Mathematicae Graph Theory, 2021 A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e ∈ E(G)}, there exists a proper edge-coloring φ of G such that φ(e) ∈ L(e) for all e ∈ E(G). If G is edge-L-colorable for every edge assignment L such that |L(e)| ≥ k for all e ∈ E(
Hu Linna, Sun Lei, Wu Jian-Liang
doaj +1 more source
Facial Rainbow Coloring of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 A vertex coloring of a plane graph G is a facial rainbow coloring if any two vertices of G connected by a facial path have distinct colors. The facial rainbow number of a plane graph G, denoted by rb(G), is the minimum number of colors that are necessary
Jendroľ Stanislav, Kekeňáková Lucia
doaj +1 more source
T-Colorings, Divisibility and the Circular Chromatic Number
Discussiones Mathematicae Graph Theory, 2021 Let T be a T -set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T -edge spans espT (G) and espd⊙T(G), where d is a positive integer and d⊙T={0≤t≤d(maxT+1):d|t⇒t/d∈T}.d \odot T =
Janczewski Robert +2 more
doaj +1 more source
Total Dominator Chromatic Number on Various Classes of Graphs
International journal of scientific research and reviews, 2019 Let G be a graph with minimum degree at least one. A total dominator coloring of G is a proper coloring of G with the extra property that every vertex in G properly dominates a color class.
Dr.A. Vijayalekshmi, S. Anusha
semanticscholar +1 more source
On the logical strengths of partial solutions to mathematical problems
Transactions of the London Mathematical Society, Volume 4, Issue 1, Page 30-71, December 2017., 2017 Abstract We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to find a complete solution. Following Flood [‘Reverse mathematics and a Ramsey‐type König's lemma’, J. Symb. Log.
Laurent Bienvenu +2 more
wiley +1 more source
Oriented Chromatic Number of Cartesian Products and Strong Products of Paths
Discussiones Mathematicae Graph Theory, 2019 An oriented coloring of an oriented graph G is a homomorphism from G to H such that H is without selfloops and arcs in opposite directions. We shall say that H is a coloring graph.
Dybizbański Janusz, Nenca Anna
doaj +1 more source
The List Edge Coloring and List Total Coloring of Planar Graphs with Maximum Degree at Least 7
Discussiones Mathematicae Graph Theory, 2020 A graph G is edge k-choosable (respectively, total k-choosable) if, whenever we are given a list L(x) of colors with |L(x)| = k for each x ∈ E(G) (x ∈ E(G) ∪ V (G)), we can choose a color from L(x) for each element x such that no two adjacent (or ...
Sun Lin +3 more
doaj +1 more source
ON THE RAINBOW NEIGHBOURHOOD NUMBER OF MYCIELSKI TYPE GRAPHS
International Journal of Apllied Mathematics, 2019 A rainbow neighbourhood of a graph G is the closed neighbourhood N [v] of a vertex v ∈ V (G) which contains at least one colored vertex of each color in the chromatic coloring C of G. Let G be a graph with a chromatic coloring C defined on it. The number
N. Sudev, C. Susanth, S. Kalayathankal
semanticscholar +1 more source