Results 51 to 60 of about 267 (133)
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
Journal of Mathematics, Volume 2026, Issue 1, 2026.Let G be a connected graph. A subset S⊆V(G) is called a general position set of a graph G if no shortest path in G contains more than two vertices from S. Likewise, a subset X⊆E(G) is an edge general position set if no shortest path contains more than two edges from X.
Zahra Hamed-Labbafian +2 more
wiley +1 more source
Generalized Ramsey numbers for paths in 2‐chromatic graphs
International Journal of Mathematics and Mathematical Sciences, Volume 9, Issue 2, Page 273-276, 1986., 1985 Chung and Liu have defined the d‐chromatic Ramsey number as follows. Let 1 ≤ d ≤ c and let . Let 1, 2, …, t be the ordered subsets of d colors chosen from c distinct colors. Let G1, G2, …, Gt be graphs. The d‐chromatic Ramsey number denoted by is defined as the least number p such that, if the edges of the complete graph Kp are colored in any fashion ...
R. Meenakshi, P. S. Sundararaghavan
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
A New Kind of Dominated Coloring of Some Special Graphs
Journal of Mathematics, Volume 2026, Issue 1, 2026.This paper introduces the concept of locating‐dominated coloring, a new graph coloring parameter that merges the properties of dominated coloring and locating coloring. For a connected graph G, a locating‐dominated coloring is defined as a proper dominated k‐coloring of G using an ordered partition of V(G) to k‐color classes Π = (C1, C2, …, Ck) such ...
F. Poryousefi +3 more
wiley +1 more source
On the structure of a triangle‐free infinite‐chromatic graph of Gyarfas
International Journal of Mathematics and Mathematical Sciences, Volume 6, Issue 2, Page 279-283, 1983., 1982 Gyárfás has recently constructed an elegant new example of a triangle‐free infinite graph G with infinite chromatic number. We analyze its structure by studying the properties of a nested family of subgraphs Gn whose union is G.
Larry Eggan, Frank Harary
wiley +1 more source
Generalized Sum List Colorings of Graphs
Discussiones Mathematicae Graph Theory, 2019 A (graph) property 𝒫 is a class of simple finite graphs closed under isomorphisms. In this paper we consider generalizations of sum list colorings of graphs with respect to properties 𝒫.
Kemnitz Arnfried +2 more
doaj +1 more source
Veterinary Dermatology, Volume 36, Issue 6, Page 814-824, December 2025.Background: Gabapentin reportedly decreases central sensitisation, a disorder associated with chronic pruritus in humans, although this is not well documented in cats. Its combined use with the standard antipruritic therapy for feline atopic skin syndrome (FASS) is not yet described.
Jeanne Morency +10 more
wiley +1 more source
Discussiones Mathematicae Graph Theory, 2020 Metric properties of Hanoi graphs Hnp are not as well understood as those of the closely related, but structurally simpler Sierpiński graphs Snp. The most outstanding open problem is to find the domination number of Hanoi graphs.
Hinz Andreas M., Movarraei Nazanin
doaj +1 more source
Veterinary Dermatology, Volume 36, Issue 6, Page 825-837, December 2025.Background: Inhibition of the Janus kinase pathway is an established treatment for allergic dermatitis. Objective: To evaluate the efficacy and safety of ilunocitinib for control of pruritus in dogs with allergic dermatitis in a randomised, double‐masked clinical trial.
Sophie Forster +5 more
wiley +1 more source