Results 281 to 290 of about 84,264 (306)
All-to-all reconfigurability with sparse and higher-order Ising machines. [PDF]
Nat CommunNikhar S +4 more
europepmc +1 more source
The local vertex anti-magic coloring for certain graph operations. [PDF]
HeliyonUma L, Rajasekaran G.
europepmc +1 more source
Characterizing the effects of age, puberty, and sex on variability in resting-state functional connectivity in late childhood and early adolescence. [PDF]
NeuroimageDuffy KA +8 more
europepmc +1 more source
E-ABIN: an explainable module for anomaly detection in biological networks. [PDF]
NAR Genom BioinformLomoio U, Mazza T, Veltri P, Guzzi PH.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
SIAM Journal on Applied Mathematics, 1975
The coloration of graphs having vertices preassigned to specific colors is discussed. Also considered is the case of graphs which have vertices that are not to be assigned to specified colors, with the colors being dependent upon each particular vertex.
Neufeld, G. A., Tartar, J.
openaire +2 more sources
The coloration of graphs having vertices preassigned to specific colors is discussed. Also considered is the case of graphs which have vertices that are not to be assigned to specified colors, with the colors being dependent upon each particular vertex.
Neufeld, G. A., Tartar, J.
openaire +2 more sources
Cut-Colorings in Coloring Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhakta, Prateek +5 more
openaire +2 more sources
2013
In this chapter a particular type of graph labeling, called graph coloring, is introduced and discussed. In the first part, the simple type of coloring, vertex coloring, is focused. Thus, concerning vertex coloring, some terms and definitions are introduced.
Faraz Dadgostari, Mahtab Hosseininia
openaire +2 more sources
In this chapter a particular type of graph labeling, called graph coloring, is introduced and discussed. In the first part, the simple type of coloring, vertex coloring, is focused. Thus, concerning vertex coloring, some terms and definitions are introduced.
Faraz Dadgostari, Mahtab Hosseininia
openaire +2 more sources
2017
This chapter considers the concept of coloring the vertices of a graph by focusing on the Four Color Problem. It begins with a discussion of three mathematics problems that involve conjecture, attributed to Pierre Fermat, Leonhard Euler, and Christian Goldbach.
Arthur Benjamin +2 more
openaire +1 more source
This chapter considers the concept of coloring the vertices of a graph by focusing on the Four Color Problem. It begins with a discussion of three mathematics problems that involve conjecture, attributed to Pierre Fermat, Leonhard Euler, and Christian Goldbach.
Arthur Benjamin +2 more
openaire +1 more source
Proceedings of the 49th Annual Southeast Regional Conference, 2011
There are basically three main graph coloring problems: vertex, edge, or face colorings of a given graph G. Graph colorings have applications in many optimization problems mainly in scheduling and assignment. In this study, we define color sequence, maximum color sequence, perfect color sequence, and almost perfect color sequence.
openaire +1 more source
There are basically three main graph coloring problems: vertex, edge, or face colorings of a given graph G. Graph colorings have applications in many optimization problems mainly in scheduling and assignment. In this study, we define color sequence, maximum color sequence, perfect color sequence, and almost perfect color sequence.
openaire +1 more source