Results 11 to 20 of about 861 (108)

Pseudomonas aeruginosa isolation from dog grooming products used by private owners or by professional pet grooming salons: prevalence and risk factors

open access: yesVeterinary 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

Influence of hospital size on antimicrobial resistance and advantages of restricting antimicrobial use based on cumulative antibiograms in dogs with Staphylococcus pseudintermedius infections in Japan

open access: yesVeterinary Dermatology, Volume 32, Issue 6, Page 668-e178, December 2021., 2021
Background Antimicrobial resistance in Staphylococcus pseudintermedius (SP) and the prevalence of meticillin‐resistant SP (MRSP) is increasing in dogs worldwide. Objectives To evaluate the influence of hospital size on antimicrobial resistance of SP and whether restricted use of antimicrobials based on antibiograms could reduce the identification of ...
Keita Iyori   +5 more
wiley   +1 more source

Decomposing tournaments into paths

open access: yesProceedings of the London Mathematical Society, Volume 121, Issue 2, Page 426-461, August 2020., 2020
Abstract We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from 1976. Kelly's conjecture states that every regular tournament has an edge decomposition into Hamilton cycles, and this was proved by Kühn and Osthus for large tournaments. The conjecture of Alspach, Mason, and Pullman asks for the minimum number
Allan Lo   +3 more
wiley   +1 more source

2-generated Cayley digraphs on nilpotent groups have hamiltonian paths [PDF]

open access: yes, 2011
Suppose G is a nilpotent, finite group. We show that if {a,b} is any 2-element generating set of G, then the corresponding Cayley digraph Cay(G;a,b) has a hamiltonian path.
Morris, Dave Witte
core   +3 more sources

The Second Neighbourhood for Bipartite Tournaments

open access: yesDiscussiones Mathematicae Graph Theory, 2019
Let T (X ∪ Y, A) be a bipartite tournament with partite sets X, Y and arc set A. For any vertex x ∈ X ∪Y, the second out-neighbourhood N++(x) of x is the set of all vertices with distance 2 from x.
Li Ruijuan, Sheng Bin
doaj   +1 more source

The {−2,−1}-Selfdual and Decomposable Tournaments

open access: yesDiscussiones Mathematicae Graph Theory, 2018
We only consider finite tournaments. The dual of a tournament is obtained by reversing all the arcs. A tournament is selfdual if it is isomorphic to its dual.
Boudabbous Youssef, Ille Pierre
doaj   +1 more source

On the n-Partite Tournaments with Exactly n − m + 1 Cycles of Length m

open access: yesDiscussiones Mathematicae Graph Theory, 2021
Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (2006) 17–21] raised the following two problems: (1) Let m ∈ {3, 4, . . ., n}.
Guo Qiaoping, Meng Wei
doaj   +1 more source

Vertices with the Second Neighborhood Property in Eulerian Digraphs

open access: yes, 2014
The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property.
Dong-Lan Luo (608306)   +8 more
core   +4 more sources

Outpaths of Arcs in Regular 3-Partite Tournaments

open access: yesDiscussiones Mathematicae Graph Theory, 2021
Guo [Outpaths in semicomplete multipartite digraphs, Discrete Appl. Math. 95 (1999) 273–277] proposed the concept of the outpath in digraphs. An outpath of a vertex x (an arc xy, respectively) in a digraph is a directed path starting at x (an arc xy ...
Guo Qiaoping, Meng Wei
doaj   +1 more source

Coloring Sums of Extensions of Certain Graphs [PDF]

open access: yes, 2016
Recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted by $\chi(G).$ In this paper the concepts of $\chi$'-chromatic sum and $\chi^+$-chromatic sum are introduced. The extended
Bej, Saptarshi, Kok, Johan
core   +4 more sources

Home - About - Disclaimer - Privacy