Results 61 to 70 of about 12,385 (266)
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A graph $G$ is equitably $k$-choosable if, for any given $k$-uniform list assignment $L$, $G$ is $L$-colorable and each color appears on at most $\lceil\frac{|V(G)|}{k}\rceil$ vertices.
Aijun Dong, Jianliang Wu
doaj +1 more source
Chordal multipartite graphs and chordal colorings
Discrete Mathematics, 2007 A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal.
openaire +1 more source
Decoding Spatial Heterogeneity and Multi‐Omics Regulation with Hierarchical Graph Learning
Advanced Science, EarlyView.ABSTRACT Recent advances in spatial multi‐omics technologies have enabled the simultaneous profiling of multiple molecular layers within the same tissue slice, providing unprecedented opportunities to investigate tissue spatial organization. However, most existing computational methods identify spatial domains in a purely data‐driven manner, rarely ...
Jiazhou Chen +6 more
wiley +1 more source
The Hadwiger number, chordal graphs and -perfection
AKCE International Journal of Graphs and Combinatorics, 2017 A graph is chordal if every induced cycle has three vertices. The Hadwiger number is the order of the largest complete minor of a graph. We characterize the chordal graphs in terms of the Hadwiger number and we also characterize the families of graphs ...
Christian Rubio-Montiel
doaj +1 more source
On an edge partition and root graphs of some classes of line graphs
Electronic Journal of Graph Theory and Applications, 2017 The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line ...
K Pravas, A. Vijayakumar
doaj +1 more source
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri N. Peled, Udi Rotics
openaire +1 more source
Advanced Science, EarlyView.In renal calcium oxalate stone formation, G6PC downregulation leads to lactate accumulation. This lactate mediates CBP/p300‐dependent lactylation of SNAIL1 at K206, promoting its nuclear translocation. Nuclear SNAIL1 activates the TGF‐β/SMAD3 pathway, driving epithelial‐mesenchymal transition and fibrosis, which ultimately facilitates crystal ...
Kai Liu +16 more
wiley +1 more source
Generalized chordality, vertex separators and hyperbolicity on graphs
, 2017 Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides.
Martínez-Pérez, Álvaro
core +1 more source
Electronic Notes in Discrete Mathematics, 2011 Matrix partition problems generalize graph colouring and homomorphism problems and occur frequently in the study of perfect graphs. It is difficult to decide, even for a small matrix M, whether the M-partition problem is polynomial time solvable or NP-complete (or possibly neither), and whether M-partitionable graphs can be characterized by a finite ...
Tomás Feder +2 more
openaire +1 more source
MusicSwarm: Biologically Inspired Intelligence for Music Composition
Advanced Intelligent Systems, EarlyView.Biologically inspired swarms of frozen foundation models self‐organize to compose complex music without fine‐tuning. By coordinating through stigmergic signals, decentralized agents dynamically evolve specialized roles and adapt to solve complex tasks.
Markus J. Buehler
wiley +1 more source