Results 31 to 40 of about 992 (103)
Veterinary Dermatology, Volume 36, Issue 5, Page 647-659, October 2025.Background – Inhibition of the Janus kinase (JAK) pathway is a well‐established option for canine atopic dermatitis (cAD). Objective – To evaluate the efficacy and safety of ilunocitinib, a novel JAK inhibitor for the control of pruritus and skin lesions in client‐owned dogs with cAD.
Sophie Forster +5 more
wiley +1 more source
Facial [r,s,t]-Colorings of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július +3 more
doaj +1 more source
A Survey on the Cyclic Coloring and its Relaxations
Discussiones Mathematicae Graph Theory, 2021 A cyclic coloring of a plane graph is a vertex coloring such that any two vertices incident with the same face receive distinct colors. This type of coloring was introduced more than fifty years ago, and a lot of research in chromatic graph theory was ...
Czap Július +2 more
doaj +1 more source
Veterinary Dermatology, Volume 36, Issue 4, Page 453-461, August 2025.Background – Canine atopic dermatitis (cAD) is a chronic, inflammatory, multifactorial and pruritic disease. The presence of skin barrier impairment (e.g. filaggrin alterations), along with abnormal immune responses, can negatively impact cutaneous barrier function.
Wendie Roldan Villalobos +5 more
wiley +1 more source
Galois connections between sets of paths and closure operators in simple graphs
Open Mathematics, 2018 For every positive integer n,we introduce and discuss an isotone Galois connection between the sets of paths of lengths n in a simple graph and the closure operators on the (vertex set of the) graph.
Šlapal Josef
doaj +1 more source
Coverings of Cubic Graphs and 3-Edge Colorability
Discussiones Mathematicae Graph Theory, 2021 Let h:G˜→Gh:\tilde G \to G be a finite covering of 2-connected cubic (multi)graphs where G is 3-edge uncolorable. In this paper, we describe conditions under which G˜\tilde G is 3-edge uncolorable. As particular cases, we have constructed regular and
Plachta Leonid
doaj +1 more source
A generalization of Vassiliev's planarity criterion [PDF]
, 2012 Motivated by his studies in knot theory V. Vassiliev introduced $X$-graphs as regular 4-valent graph with a structure of pairs of opposite edges at each vertex.
Friesen, Tyler
core
Journal of Applied Mathematics, Volume 2025, Issue 1, 2025.This article explores numerous significant additive topological indices based on degrees for linear functional graphs over finite‐dimensional vector spaces. Specifically, we derive some unique topological indices, such as the eccentricity‐based indices and the Wiener index.
Vinnarasi L. +4 more
wiley +1 more source
The Crossing Number of Cartesian Product of 5-Wheel with any Tree
Discussiones Mathematicae Graph Theory, 2021 In this paper, we establish the crossing number of join product of 5-wheel with n isolated vertices. In addition, the exact values for the crossing numbers of Cartesian products of the wheels of order at most five with any tree T are given.
Wang Yuxi, Huang Yuanqiu
doaj +1 more source
3-regular colored graphs and classification of surfaces
, 2017 Motivated by the theory of crystallizations, we consider an equivalence relation on the class of $3$-regular colored graphs and prove that up to this equivalence (a) there exists a unique contracted 3-regular colored graph if the number of vertices is ...
Basak, Biplab
core +1 more source