Results 101 to 110 of about 117,877 (279)

Total chromatic numbers

open access: yesApplied Mathematics Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A New Game Chromatic Number

open access: yesEuropean Journal of Combinatorics, 1997
A new game chromatic number \(\chi^*_g(G)\) of a graph \(G\) is introduced. The authors first show that (i) if \(G\) is a connected bipartite graph with bipartition \((V_1,V_2)\), then \(\chi^*_g(G)= 2\) if and only if \(G\) has a vertex \(v\in V_1\) (say) such that \(N(v)= V_2\); and (ii) \(\chi^*_g(G)= \chi(G)\) (the chromatic number of \(G\)) if \(G\
Chen, G., Schelp, R.H., Shreve, W.E.
openaire   +2 more sources

An Open‐Source Pipeline for Calcium Imaging and All‐Optical Physiology in Human Stem Cell‐Derived Neurons

open access: yesAdvanced Science, EarlyView.
This work introduces an open‐source all‐optical platform for functional phenotyping of human stem cell‐derived neurons. The system integrates optogenetics, calcium imaging, automated acquisition, and analysis to resolve single‐cell and network activity, enabling longitudinal measurements, disease modeling, and pharmacological screening in preclinical ...
Wardiya Afshar‐Saber   +12 more
wiley   +1 more source

The incidence chromatic number of some graph

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2005
The concept of the incidence chromatic number of a graph was introduced by Brualdi and Massey (1993). They conjectured that every graph G can be incidence colored with Δ(G)+2 colors.
Liu Xikui, Li Yan
doaj   +1 more source

Graphs obtained from collections of blocks

open access: yesElectronic Journal of Graph Theory and Applications, 2015
Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially ...
Colton Magnant   +2 more
doaj   +1 more source

Genome‐Wide Association Study Reveals Insect Genetics and Microbial Symbiont Effects on Susceptibility of Diaphorina citri to the Citrus Greening Pathogen, Candidatus Liberibacter Asiaticus

open access: yesAdvanced Science, EarlyView.
This study investigates the genetic and microbial factors influencing the susceptibility of Diaphorina citri to the citrus greening pathogen Candidatus Liberibacter asiaticus (CLas), employing a microbiome Genome Wide Association Study. The research identifies a key gene encoding an MFS‐type transporter contributing to CLas infectivity and abundance in
Kai Liu   +12 more
wiley   +1 more source

Tree-chromatic number

open access: yesJournal of Combinatorial Theory, Series B, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Long‐Tea‐CLIP: An Expert‐Level Multimodal AI Framework for Fine‐Grained Green Tea Grading Across Five Sensory Dimensions

open access: yesAdvanced Science, EarlyView.
Long‐Tea‐CLIP (Contrastive Language‐Image Pre‐training) presents a multimodal AI framework that integrates visual, metabolomic, and sensory knowledge to grade green tea across appearance, soup color, aroma, taste, and infused leaf. By combining expert‐guided modeling with CLIP‐supervised learning, the system delivers fine‐grained quality evaluation and
Yanqun Xu   +9 more
wiley   +1 more source

Borel chromatic number of closed graphs

open access: yes, 2014
We construct, for each countable ordinal $\xi$, a closed graph with Borel chromatic number two and Baire class $\xi$ chromatic number $\aleph\_0$.Comment: The proof of the main lemma has been changed, and the main result is now better than in the ...
Lecomte, Dominique, Zeleny, Miroslav
core  

PISOT NUMBERS AND CHROMATIC ZEROS

open access: yes, 2014
In this article we show that Pisot numbers of even degree and their powers cannot be roots of chromatic polynomials. We also consider the family of smallest Pisot numbers of odd degree. We show that they cannot be roots of chromatic polynomials of connected graphs with a certain maximum number of vertices.
openaire   +2 more sources

Home - About - Disclaimer - Privacy