Results 31 to 40 of about 1,012 (122)
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
Construction of planar 4-connected triangulations [PDF]
, 2014 In this article we describe a recursive structure for the class of 4-connected triangulations or - equivalently - cyclically 4-connected plane cubic ...
Brinkmann, Gunnar +3 more
core +2 more sources
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
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
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
Fundamental Cycles and Graph Embeddings
, 2008 In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al.
B. Mohar +10 more
core +2 more sources
Journal of Mathematics, Volume 2025, Issue 1, 2025.In its crystalline state, the α‐icosahedral nanosheet of boron demonstrates superconductivity and thermal electronic properties. Mathematical research on a graph’s structure yields a graph descriptor, a numerical measure. Chemical graph theory employs connectivity descriptors to analyze molecular structures, providing crucial insights into many ...
Khalil Hadi Hakami +3 more
wiley +1 more source