Results 1 to 10 of about 124 (114)
A Note on Edge-Group Choosability of Planar Graphs without 5-Cycles
Journal of Mathematics, 2020 This paper is devoted to a study of the concept of edge-group choosability of graphs. We say that G is edge-k-group choosable if its line graph is k-group choosable.
Amir Khamseh
doaj +3 more sources
Even circuits in oriented matroids [PDF]
, 2022 In this paper we generalise the even directed cycle problem, which asks whether a given digraph contains a directed cycle of even length, to orientations of regular matroids.
Heuer, Karl +2 more
core +1 more source
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 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
On L(2, 1)-Labelings of Oriented Graphs
Discussiones Mathematicae Graph Theory, 2022 We extend a result of Griggs and Yeh about the maximum possible value of the L(2, 1)-labeling number of a graph in terms of its maximum degree to oriented graphs.
Colucci Lucas, Győri Ervin
doaj +1 more source
Disjoint dijoins for classes of dicuts in finite and infinite digraphs [PDF]
, 2022 A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of a set of edges meeting every non-empty dicut equals ...
Heuer, Karl +3 more
core +1 more source
Ascending Subgraph Decompositions of Oriented Graphs that Factor into Triangles
Discussiones Mathematicae Graph Theory, 2022 In 1987, Alavi, Boals, Chartrand, Erdős, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). In a previous paper, Wagner showed that all oriented complete balanced tripartite graphs have an ASD.
Austin Andrea D., Wagner Brian C.
doaj +1 more source
Extremal Digraphs Avoiding Distinct Walks of Length 4 with the Same Endpoints
Discussiones Mathematicae Graph Theory, 2022 Let n ≥ 8 be an integer. We characterize the extremal digraphs of order n with the maximum number of arcs avoiding distinct walks of length 4 with the same endpoints.
Lyu Zhenhua
doaj +1 more source
Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Let $D$ be a strong balanced digraph on $2a$ vertices. Adamus et al. have proved that $D$ is hamiltonian if $d(u)+d(v)\ge 3a$ whenever $uv\notin A(D)$ and $vu\notin A(D)$. The lower bound $3a$ is tight.
Ruixia Wang, Linxin Wu, Wei Meng
doaj +1 more source
Minimizing cycles in tournaments and normalized \(q\)-norms [PDF]
, 2022 Akin to the Erdős-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any \(d\in (0,1]\), among all \(n\)-vertex tournaments with \(d\binom{n}{3}\) many 3-cycles, the number of 4-cycles is asymptotically minimized
Tang, Tianyun, Ma, Jie
core +1 more source