Results 41 to 50 of about 9,631,849 (193)
Long Cycles in Chromatic Digraphs Spanned by Hamiltonian Directed Paths
MathematicsLet C be any oriented cycle on n vertices. We show that every (10n−4)-chromatic digraph spanned by a Hamiltonian directed path contains a subdivision of C.
Salman Ghazal, Nadine Dirani
doaj +1 more source
Advanced Science, EarlyView.Recent advances in metasurface‐enabled low‐observable technologies are reviewed from the perspective of cross‐scale material–structure synergy. Electromagnetic, thermal, optical, and acoustic stealth are highlighted together with dynamic tuning, programmable coding, data‐driven inverse design, artificial intelligence, multispectral compatibility, and ...
Shuhao Wang +5 more
wiley +1 more source
The Simple Chromatic Number of Oriented Graphs
Electronic Notes in Discrete Mathematics, 2000 Abstract We define a notion of simple k-coloring of an oriented graph G → as an assignement c of colors from the set {1, 2,…, k} to the vertices of G → in such a way that at least two colors are used and the following property is satisfied: if (x,y), (x', y') are two edges of G → and c(x) = c(y'), then c(y) ≠ c(x') or c(x) = c(y).
openaire +2 more sources
Advanced Science, EarlyView.Adult human organotypic cortical slices undergo marked neuronal loss, laminar disruption, and glial activation, yet their network activity progressively stabilizes after a variable period. Electrophysiology, longitudinal calcium imaging, and quantitative histology show that structurally remodeled human circuits show adaptive capacity resulting in ...
Estilla Zsófia Tóth +20 more
wiley +1 more source
Advanced Science, EarlyView.This work presents a large‐cell‐compatible droplet microfluidic platform that overcomes long‐standing barriers in plant cell culture by enabling high‐fidelity encapsulation, novel multilayer 3D droplet incubation for scalable long‐term culture, and support for the full developmental progression of large plant cells.
Arman Mirmiran +10 more
wiley +1 more source
Pushable chromatic number of graphs with degree constraints [PDF]
, 2021 International audiencePushable homomorphisms and the pushable chromatic number $\chi_p$ of oriented graphs were introduced by Klostermeyer and MacGillivray in 2004. They notably observed that, for any oriented graph $\overrightarrow{G}$, we have $\chi_p(\
Paul, Soumyajit +6 more
core +1 more source
Advanced Intelligent Discovery, EarlyView.Sequential multicolor fluorescence imaging in dynamic microsystems is constrained by acquisition speed and excitation dose. This study introduces a real‐time framework to reconstruct spectrally separated channels from reduced cross‐channel acquisitions (frames containing mixed spectral contributions).
Juan J. Huaroto +3 more
wiley +1 more source
Oriented hypergraphs, stability numbers and chromatic numbers
Discrete Mathematics, 1981 AbstractOriented hypergraphs are defined, so that it is possible to generalize propositions characterizing the chromatic number and the stability number of a graph by means of orientations and elementary paths, to the strong and weak chromatic number and the strong and weak stability number of a hypergraph.
openaire +2 more sources
Chromatic roots are dense in the whole complex plane [PDF]
, 2004 I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l.
Sokal, AD
core
Advanced Intelligent Systems, EarlyView.A schema‐first alignment framework builds compact, executable domain‐specific language models under data scarcity. Large‐scale synthetic question‐answer generation instills domain knowledge, and a code‐centric IR‐to‐DPO pipeline aligns generation with tool‐executable syntax.
Di Wang +4 more
wiley +1 more source