Results 31 to 40 of about 269 (132)
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
Burnside Chromatic Polynomials of Group-Invariant Graphs
Discussiones Mathematicae Graph Theory, 2023 We introduce the Burnside chromatic polynomial of a graph that is invariant under a group action. This is a generalization of the Q-chromatic function Zaslavsky introduced for gain graphs.
White Jacob A.
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
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
Homomorphism and sigma polynomials
International Journal of Mathematics and Mathematical Sciences, Volume 18, Issue 4, Page 653-658, 1995., 1995 By establishing a connection between the sigma polynomial and the homomorphism polynomial, many of the proofs for computing the sigma polynmial are simplified, the homomorphism polynomial can be identified for several new classes of graphs, and progress can be made on identifying homomorphism polynomials.
Richard Alan Gillman
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2023 DP-coloring is generalized via relaxed coloring and variable degeneracy in [P. Sittitrai and K. Nakprasit, Su cient conditions on planar graphs to have a relaxed DP-3-coloring, Graphs Combin. 35 (2019) 837–845], [K.M. Nakprasit and K.
Sribunhung Sarawute +3 more
doaj +1 more source
Locating‐Dominator Coloring of Some Certain Graphs
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.Let G be a graph. A dominator coloring of G is a proper vertex coloring such that every vertex dominates all vertices of at least one color class. Given a dominator k‐coloring c with color classes Ci(1 ≤ i ≤ k) and an ordered partition Π = (C1, …, Ck) of V(G), the dominator code of a vertex v ∈ V(G) with respect to Π is defined as the k‐tuple dcΠ(v) = (
S. Nikbakht +3 more
wiley +1 more source
Homomorphisms and related contractions of graphs
International Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 1, Page 95-100, 1988., 1986 For every homomorphism ϕ of a graph G there exists a contraction θϕ on , the complement of G. Here we study the graph equation . In the course of our work we show that Hadwiger′s Conjecture is true for every self‐complementary graph.
Robert D. Girse, Richard A. Gillman
wiley +1 more source
b-Coloring of the Mycielskian of Some Classes of Graphs
Discussiones Mathematicae Graph Theory, 2022 The b-chromatic number b(G) of a graph G is the maximum k for which G has a proper vertex coloring using k colors such that each color class contains at least one vertex adjacent to a vertex of every other color class.
Raj S. Francis, Gokulnath M.
doaj +1 more source
Resolving Edge Colorings: Exact Results and a Tabu Search Heuristic
International Journal of Mathematics and Mathematical Sciences, Volume 2026, Issue 1, 2026.This study presents new results on resolving edge colorings in graphs, a concept introduced by V. Saenpholphat and P. Zhang in 2003. We determine the resolving edge chromatic number for several well‐known families of graphs, including complete graphs, complete bipartite graphs, wheel graphs, sun graphs, and friendship graphs.
Narjes Sabeghi +4 more
wiley +1 more source