Results 11 to 20 of about 208 (79)
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 +2 more sources
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
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
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
Gallai-Ramsey Numbers for Rainbow S3+S_3^ + and Monochromatic Paths
Discussiones Mathematicae Graph Theory, 2022 Motivated by Ramsey theory and other rainbow-coloring-related problems, we consider edge-colorings of complete graphs without rainbow copy of some fixed subgraphs.
Li Xihe, Wang Ligong
doaj +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
Linear List Coloring of Some Sparse Graphs
Discussiones Mathematicae Graph Theory, 2021 A linear k-coloring of a graph is a proper k-coloring of the graph such that any subgraph induced by the vertices of any pair of color classes is a union of vertex-disjoint paths. A graph G is linearly L-colorable if there is a linear coloring c of G for
Chen Ming, Li Yusheng, Zhang Li
doaj +1 more source
DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
Forum of Mathematics, Sigma, 2016 The dichromatic number of a graph $G$ is the maximum integer $k$
BOJAN MOHAR, HEHUI WU
doaj +1 more source
Conflict-Free Vertex Connection Number At Most 3 and Size of Graphs
Discussiones Mathematicae Graph Theory, 2021 A path in a vertex-coloured graph is called conflict-free if there is a colour used on exactly one of its vertices. A vertex-coloured graph is said to be conflict-free vertex-connected if any two distinct vertices of the graph are connected by a conflict-
Doan Trung Duy, Schiermeyer Ingo
doaj +1 more source