Results 21 to 30 of about 1,606 (89)
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
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 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
Packing Coloring of Some Undirected and Oriented Coronae Graphs
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +1 more source
Veterinary Dermatology, Volume 27, Issue 5, Page 391-e98, October 2016., 2016 Background– Pseudomonas aeruginosa (PA) may cause suppurative otitis externa with severe inflammation and ulceration in dogs. Multidrug resistance is commonly reported for this organism, creating a difficult therapeutic challenge. Objective– The aim of this study was to evaluate the in vitro antimicrobial activity of a gel containing 0.5 µg/mL of ...
Giovanni Ghibaudo +6 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2018 In 1940, Lebesgue proved that every 3-polytope contains a 5-vertex for which the set of degrees of its neighbors is majorized by one of the following sequences: (6, 6, 7, 7, 7), (6, 6, 6, 7, 9), (6, 6, 6, 6, 11), (5, 6, 7, 7, 8), (5, 6, 6, 7, 12), (5, 6,
Borodin Oleg V. +2 more
doaj +1 more source
On resolving edge colorings in graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2003, Issue 46, Page 2947-2959, 2003., 2003 We study the relationships between the resolving edge chromatic number and other graphical parameters and provide bounds for the resolving edge chromatic number of a connected graph.
Varaporn Saenpholphat, Ping Zhang
wiley +1 more source
On the Palette Index of Complete Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2018 The palette of a vertex x of a graph G determined by a proper edge colouring φ of G is the set {φ(xy) : xy ∈ E(G)} and the diversity of φ is the number of different palettes determined by φ. The palette index of G is the minimum of diversities of φ taken
Horňák Mirko, Hudák Juraj
doaj +1 more source