Results 11 to 20 of about 1,634 (112)
Veterinary Dermatology, Volume 33, Issue 4, Page 316-e73, August 2022., 2022 Abstract Background Pseudomonas aeruginosa is the most commonly isolated bacterium from skin lesions of dogs with post‐grooming furunculosis (PGF). It is frequently found in human hair and skin care products, and may pose a health risk to consumers. Information regarding the prevalence of P. aeruginosa contamination of dog grooming products is lacking.
Elad Perry +5 more
wiley +1 more source
Veterinary Dermatology, Volume 33, Issue 1, Page 17-e6, February 2022., 2022 Background – Because of the increased incidence of multidrug‐resistant (MDR) bacteria, the use of disinfectants over antibiotics has been encouraged. However, the interactions between disinfectants and host local immunity are poorly understood. Objective – To assess the effects of chlorhexidine digluconate (Chx), with and without selected host defence ...
Domenico Santoro +3 more
wiley +1 more source
Coloring the Voronoi tessellation of lattices
Journal of the London Mathematical Society, Volume 104, Issue 3, Page 1135-1171, October 2021., 2021 Abstract In this paper we define the chromatic number of a lattice: It is the least number of colors one needs to color the interiors of the cells of the Voronoi tessellation of a lattice so that no two cells sharing a facet are of the same color. We compute the chromatic number of the root lattices, their duals, and of the Leech lattice, we consider ...
Mathieu Dutour Sikirić +3 more
wiley +1 more source
Total Dominator Colorings in Cycles [PDF]
, 2012 Determining the total dominator chromatic number in ...
Vijayalekshmi, A.
core +2 more sources
More on the Minimum Size of Graphs with Given Rainbow Index
Discussiones Mathematicae Graph Theory, 2020 The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand et al., is a natural generalization of the rainbow connection number of a graph.
Zhao Yan
doaj +1 more source
Sum-List Colouring of Unions of a Hypercycle and a Path with at Most Two Vertices in Common
Discussiones Mathematicae Graph Theory, 2020 Given a hypergraph and a function f : V () → , we say that is f-choosable if there is a proper vertex colouring ϕ of such that ϕ (v) ∈ L(v) for all v ∈ V (), where L : V () → 2 is any assignment of f(v) colours to a vertex v.
Drgas-Burchardt Ewa +1 more
doaj +1 more source
Maximum Edge-Colorings Of Graphs
Discussiones Mathematicae Graph Theory, 2016 An r-maximum k-edge-coloring of G is a k-edge-coloring of G having a property that for every vertex v of degree dG(v) = d, d ≥ r, the maximum color, that is present at vertex v, occurs at v exactly r times. The r-maximum index χr′(G)$\chi _r^\prime (G)$
Jendrol’ Stanislav +1 more
doaj +1 more source
Facial Incidence Colorings of Embedded Multigraphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a cellular embedding of a multigraph in a 2-manifold. Two distinct edges e1, e2 ∈ E(G) are facially adjacent if they are consecutive on a facial walk of a face f ∈ F(G). An incidence of the multigraph G is a pair (v, e), where v ∈ V (G), e ∈ E(G)
Jendrol’ Stanislav +2 more
doaj +1 more source
On the ρ-Edge Stability Number of Graphs
Discussiones Mathematicae Graph Theory, 2022 For an arbitrary invariant ρ(G) of a graph G the ρ-edge stability number esρ(G) is the minimum number of edges of G whose removal results in a graph H ⊆ G with ρ(H) ≠ ρ(G) or with E(H) = ∅.
Kemnitz Arnfried, Marangio Massimiliano
doaj +1 more source
Tr-Span of Directed Wheel Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +1 more source