Results 61 to 70 of about 1,320 (180)

Applications of Machine Learning in Noninvasive Anemia Diagnosis: A Systematic Review Based on Cross‐Industry Standard Process for Data Mining

Health Science Reports, Volume 9, Issue 9, September 2026.
ABSTRACT Background and Aims Anemia is a disorder caused by insufficient red blood cell count or hemoglobin concentration, affecting nearly a quarter of the global population each year. An undiagnosed condition can escalate into life‐threatening complications, particularly among pregnant women and children. Although anemia causes identifiable symptoms,
Mohammad Hadi Ghahroudi, Niloofar Mohammadzadeh, Hadiseh Ghadiri Bidhendi   +2 more
wiley   +1 more source

Materials and Music: Selective Imperfection as a Generative Framework for Analysis, Creativity and Discovery

Interdisciplinary Materials, Volume 5, Issue 5, Page 834-867, September 2026.
Vibrations in matter, from spider webs to molecules, water to flames, share a grammar with music. We propose that creativity emerges when constraints force expansion beyond existing possibilities. Selective imperfection restores balance, enabling invention.
Markus J. Buehler
wiley   +1 more source

Characteristic numbers and chromatic polynomial of a tensor

Forum of Mathematics, Sigma
We introduce the characteristic numbers and the chromatic polynomial of a linear subspace of matrices, or equivalently of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of ...
Austin Conner, Mateusz Michalek
doaj   +1 more source

Signed Projective Cubes, a Homomorphism Point of View

Journal of Graph Theory, Volume 113, Issue 1, Page 38-56, September 2026.
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen, Reza Naserasr, Alessandra Sarti   +2 more
wiley   +1 more source

Colourings of (k-r,k)-trees [PDF]

Opuscula Mathematica, 2017
Trees are generalized to a special kind of higher dimensional complexes known as \((j,k)\)-trees ([L. W. Beineke, R. E. Pippert, On the structure of \((m,n)\)-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80]), and which
M. Borowiecki, H. P. Patil
doaj   +1 more source

A bibliography on chromatic polynomials

Discrete Mathematics, 1997
Our intention is to make this bibliography as complete as possible and as such, some marginally related references are also included.
openaire   +3 more sources

Chromatic Polynomials of Oriented Graphs

The Electronic Journal of Combinatorics, 2019
The oriented chromatic polynomial of a oriented graph outputs the number of oriented $k$-colourings for any input $k$. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph, closing an open problem posed by Sopena.
Danielle Cox, Christopher Duffy 0001
openaire   +6 more sources

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová, Jiří Kalvoda, Gaurav Kucheriya, Sophie Spirkl   +3 more
wiley   +1 more source

The multivariate arithmetic Tutte polynomial [PDF]

Discrete Mathematics & Theoretical Computer Science, 2012
We introduce an arithmetic version of the multivariate Tutte polynomial recently studied by Sokal, and a quasi-polynomial that interpolates between the two.
Petter Brändèn, Luca Moci
doaj   +1 more source

Certificates of Factorisation for Chromatic Polynomials

The Electronic Journal of Combinatorics, 2009
The chromatic polynomial gives the number of proper $\lambda$-colourings of a graph $G$. This paper considers factorisation of the chromatic polynomial as a first step in an algebraic study of the roots of this polynomial. The chromatic polynomial of a graph is said to have a chromatic factorisation if $P({G},\lambda)=P({H_{1}},\lambda)P({H_{2 ...
Kerri Morgan, Graham Farr
openaire   +2 more sources