Results 11 to 20 of about 9,431,687 (143)
On game chromatic number of oriented network graphs
In this paper, we determine the game chromatic number of oriented honeycomb network graphs and oriented cube connected cycle network graphs.
Alagammai Renganathan, V. Vijayalakshmi
doaj +2 more sources
Game Chromatic Number on Segmented Caterpillars [PDF]
Graph theory is the study of sets vertices connected by known as edges, which are depicted as lines. The graph coloring game is a game played on a graph with two players, Alice and Bob, such that they alternate to properly color a graph, meaning no ...
Beidelman, Paige
core +3 more sources
The fractional chromatic number of triangle-free subcubic graphs [PDF]
Heckman and Thomas conjectured that the fractional chromatic number of any triangle-free subcubic graph is at most 14 / 5. Improving on estimates of Hatami and Zhu and of Lu and Peng, we prove that the fractional chromatic number of any triangle-free ...
Král’, Daniel +5 more
core +1 more source
The harmonious chromatic number of almost all trees [PDF]
A harmonious colouring of a simple graph G is a proper vertex colouring such that each pair of colours appears together on at most one edge. The harmonious chromatic number h(G) is the least number of colours in such a colouring.For any positive integer ...
Edwards, Keith
core +1 more source
A bound for the game chromatic number of graphs [PDF]
We show that if a graph has acyclic chromatic number k, then its game chromatic number is at most k(k + 1). By applying the known upper bounds for the acyclic chromatic numbers of various classes of graphs, we obtain upper bounds for the game chromatic ...
Xuding Zhu +3 more
core +1 more source
Circular game chromatic number of graphs [PDF]
In a circular r-colouring game on G, Alice and Bob take turns colouring the vertices of G with colours from the circle S(r) of perimeter r. Colours assigned to adjacent vertices need to have distance at least 1 in S(r).
Wensong Lin +3 more
core +1 more source
An agentic AI‐driven decision‐support framework for prosumers is proposed, integrating PV generation, load profiling, and multihorizon optimization within a four‐agent architecture. The approach significantly reduces grid dependence, enhances self‐sufficiency and prevents system oversizing.
Adela BÂRA, Simona‐Vasilica OPREA
wiley +1 more source
Bilangan Kromatik Permainan Graf Ubur-Ubur, Graf Siput, dan Graf Gurita
Graph coloring is the process of assigning colors to the vertices or edges of a graph. Specifically, coloring the vertices in graph coloring can be implemented in graph coloring games.
M Luthfi Abdurahman +2 more
doaj +1 more source
Human Monocytic Models Reveal Genotype‐Dependent Inflammatory Programs in VEXAS Syndrome
Objectives VEXAS syndrome is a severe X‐linked autoinflammatory disorder caused by somatic mutations in ubiquitin‐like modifier activating enzyme 1 (UBA1), with clinical outcomes that vary by UBA1 genotype. We aimed to elucidate genotype‐specific inflammatory programs and identify potential therapeutic targets.
Kana Higashitani +10 more
wiley +1 more source
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core

